16596 search results - page 307 / 3320 » Generalized Assignment Problems |
158
click to vote
ESA
2004
Springer
16 years 6 days ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
190
click to vote
ICMI
2004
Springer
16 years 6 days ago
2004
Springer
Although several real multimodal systems have been built, their development still remains a difficult task. In this paper we address this problem of development of multimodal inte...
204
click to vote
CODES
2003
IEEE
16 years 3 days ago
2003
IEEE
the level of abstraction in system design promises to enable faster exploration of the design space at early stages. While scheduling decision for embedded software has great impa...
148
click to vote
ICRA
2003
IEEE
16 years 3 days ago
2003
IEEE
— We explore the control of a nonholonomic robot subject to additional constraints on the state variables. In our problem, the user specifies the path of a subset of the state v...
182
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We apply an adapted version of Particle Swarm Optimization to distributed unsupervised robotic learning in groups of robots with only local information. The performance of the lea...