1220 search results - page 80 / 244 » Minimal Interval Completions |
CIA
1998
Springer
14 years 1 months ago
1998
Springer
In a simple cooperative MAS model where a collection of "querying agents" can send queries to a collection of "information agents", we formalize the problem of ...
MICS
2008
13 years 9 months ago
2008
We give a new presentation of two results concerning synchronized automata. The first one gives a linear bound on the synchronization delay of complete local automata. The second o...
JCO
2007
13 years 9 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
JCO
1998
13 years 9 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...