1480 search results - page 161 / 296 » Ants can solve constraint satisfaction problems |
184
click to vote
MP
2002
15 years 6 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
182
click to vote
RTAS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper we propose a dynamic constraint transformation technique for ensuring timing requirements in a distributed real-time system possessing periodically synchronized dist...
178
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
158
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
This paper is concerned with the optimal control of linear discrete-time systems, which are subject to unknown but bounded state disturbances and mixed constraints on the state an...
172
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
— Many architectures have been proposed to solve tightly-coupled multirobot tasks (MT) through coalitions of heterogeneous robots. However, several issues remain unaddressed. As ...