589 search results - page 71 / 118 » Introducing Dynamic Constraints in B |
ICRA
2000
IEEE
14 years 13 days ago
2000
IEEE
Manufacturing enterprise automation was focused on factory level where scheduling is a key issue in the past. As more and more companies are relying on their business parmers or s...
ICRA
1998
IEEE
14 years 8 days ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
ARC
2008
Springer
13 years 10 months ago
2008
Springer
As embedded applications are getting more complex, they are also demanding highly diverse computational capabilities. The majority of all previously proposed reconfigurable archite...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
MEDINFO
2007
13 years 9 months ago
2007
Managing time-stamped data is essential to clinical research activities and often requires the use of considerable domain knowledge, which is difficult to support within database ...