Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - TASK
Search - TASK - List
能够禁用任务管理,按Ctrl+Alt+Delete将会显示任务管理器被禁用-Able to disable Task Manager, press Ctrl+ Alt+ Delete will display the Task Manager is disabled
Update : 2024-04-29 Size : 11264 Publisher : 付永明

DL : 1
加里森的任务 有n个加里森敢死队的队员要炸掉敌人的一个军火库,谁都不想去,队长加里森决定用轮回数数的办法来决定哪个战士去执行任务。如果前一个战士没完成任务,则要再派一个战士上去。现给每个战士编一个号,大家围坐成一圈,随便从某一个战士开始计数,当数到5时,对应的战士就去执行任务,且此战士不再参加下一轮计数。如果此战士没完成任务,再从下一个战士开始数数,被数到第5时,此战士接着去执行任务。以此类推,直到任务完成为止。 加里森本人是不愿意去的,假设加里森为1号,请你设计一程序为加里森支招,求出从第几号战士开始计数才能让加里森最后一个留下来而不去执行任务。 要求自拟1个实验实例验证程序正确性(即:n自拟)。 -Garrison s task A n garrison of death squads players to blow up the enemy s a Arsenal, who all don t want to go, captain garrison decided to use to cycle count to decide which soldiers to perform the task. If a soldier before didn t finish the task, want to be a warrior and send up. Now give each soldier make up a number, you sit in a circle, literally from a soldier began to count, when several to 5, the corresponding warrior is to perform the task, and the warrior will no longer take part in the next round of counting. If the soldiers didn t finish the task, and from a soldier began to count down, number to the fifth, the soldiers then to perform the task. And so on, until task completion date. Garrison himself does not want to go to is, provided garrison for 1, please design a program for the garrison court, find out what number from soldiers start counting to make garrison last to stay and not to perform the task. Since one experiment to request an example to verify the correctn
Update : 2024-04-29 Size : 701440 Publisher : 苹果

CSharpTask
DL : 0
C# Task定任务处理程序源码 运行环境:asp.net 技术特点:采用asp.net技术及线程方式进行任务定时处理 功能描述:可以定时间段、小时间、周、月、年等进行任务处理。 -C# Task scheduled task handler source operating environment: asp.net technical characteristics: the use asp.net technology and the way the thread task processing time Description: You can set time period, small-time, week, month, year, etc.-tasking.
Update : 2024-04-29 Size : 630784 Publisher : wj

介绍用C语言如何设计单片机多任务程序的方法。-Introduce how to design single-chip using C language, multi-task procedure.
Update : 2024-04-29 Size : 182272 Publisher : sdfsdf

DL : 0
任务管理器,查看任务管理器的启动项目,大家去看看啦-Task Manager, Task Manager to view the start-up projects, we see Kanla
Update : 2024-04-29 Size : 7168 Publisher : 王丽辉

DL : 0
第三次作业题目没有的赶紧下吧 真的是第三次哟不用期末考的-task and java
Update : 2024-04-29 Size : 123904 Publisher : sam

DL : 0
任务管理学习方法,在编程时如何更加节约内存、cpu的资源-Name as task manager,teach raders how to use memory & cpu effectively . source saving .
Update : 2024-04-29 Size : 539648 Publisher : 张义

Thesis : Task Scheduling Algorithms for Heterogeneous Processors
Update : 2024-04-29 Size : 158720 Publisher : Hamid

Thesis : Using ant colonies to solve multiprocessor task graph scheduling
Update : 2024-04-29 Size : 547840 Publisher : Hamid

Thesis : ALGORITHMS FOR TASK SCHEDULING IN HETEROGENEOUS COMPUTING ENVIRONMENTS
Update : 2024-04-29 Size : 479232 Publisher : Hamid

DL : 0
基于S3C2410开发箱的,在ucosii上跑的task实验工程,压缩包内是一个完整的项目工程 -Based on S3C2410 development box, run on the task at ucosii experimental projects, the compressed package contains a complete Project
Update : 2024-04-29 Size : 2219008 Publisher :

DL : 0
这个文件代码、输出结果主要是任务切换,说明任务的调换、切换的缘由-task switch
Update : 2024-04-29 Size : 19456 Publisher : 严雨

TCP client port scan,use task,in C#.
Update : 2024-04-29 Size : 123904 Publisher : li1li

delphi src code function kill task
Update : 2024-04-29 Size : 1024 Publisher : alge

DL : 0
TaskVision微软开源桌面软件!供学习之用!-Task vision!Microsoft source codes!VB.net!
Update : 2024-04-29 Size : 5521408 Publisher : uhj2008

单台机器上的任务调度问题 在一台机器上将要处理一组任务。任务的执行不具有抢先性,即一旦一个任务开始执行,就不允许被打断。任务1——7的发布时刻分别是2,5,4,0,0,8,9,持续时间分别是5,6,8,4,2,4,2,(规定完成时刻分别是10,21,15,10,5,15,22。——下面问题所求未用此条件。)是构建模型求出如下目标的最优值,且对目标函数和约束条件作必要的说明。 求:平均处理任务时间的最小值,处理任务时间是指任务发布时刻到任务完成时刻这段时间。 -Task scheduling problem on a single machine A machine will be to deal with a set of tasks. Tasks that do not have to pre-empt that once a task begins execution, it is not allowed to be interrupted. Task 1- 7 of the release time is 2,5,4,0,0,8,9, duration, respectively, 5,6,8,4,2,4,2, (for the completion time is 10 21,15,10,5,15,22.- the following questions ask unused for this condition.) is to build the model to calculate the optimal value of the following objectives, the objective function and constraints for the necessary instructions. Requirements: handling an average of the minimum task time processing tasks time task release time to task completion time during this time.
Update : 2024-04-29 Size : 1024 Publisher : 姚俊涛

Demo1: Demonstration of the use of Gaussian Mixture Regression (GMR) and inverse kinematics to reproduce a task by considering constraints both in joint space and in task space. An arm of 2 links moving in 2D space is considered. Several demonstrations of a skill are provided, by starting from different initial positions. The skill consists of moving each joint sequentially and then writing the alphabet letter N at a specific position in the 2D space.- Demo1: Demonstration of the use of Gaussian Mixture Regression (GMR) and inverse kinematics to reproduce a task by considering constraints both in joint space and in task space. An arm of 2 links moving in 2D space is considered. Several demonstrations of a skill are provided, by starting from different initial positions. The skill consists of moving each joint sequentially and then writing the alphabet letter N at a specific position in the 2D space.
Update : 2024-04-29 Size : 122880 Publisher :

DL : 0
Matlab. task for ws1. bucket 1. differential analysis.
Update : 2024-04-29 Size : 11264 Publisher : Rustam

RTX51 Tiny多任务实时操作系统 之 合作式任务切换-RTX51 Tiny multitasking real-time operating system of cooperation type task switching
Update : 2024-04-29 Size : 33792 Publisher : 张煌

51tiny实时系统 时间轮转任务切换源码-51 tiny real-time system time cycle task switching the source code
Update : 2024-04-29 Size : 34816 Publisher : 张煌
« 1 2 ... 4 5 6 7 8 910 11 12 13 14 ... 50 »
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.