1984 search results - page 176 / 397 » The colourful feasibility problem |
165
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
156
click to vote
ICTCS
2003
Springer
15 years 11 months ago
2003
Springer
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
205
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
187
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper presents the design and implementation of an adaptive open-set speaker identification system with genetic learning classifier systems. One of the challenging problems i...
160
click to vote
AAAI
2008
15 years 8 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...