2109 search results - page 151 / 422 » Solving Necklace Constraint Problems |
138
Voted
CP
2009
Springer
16 years 28 days ago
2009
Springer
This paper describes a new approach for solving disjunctive temporal problems such as the open shop and job shop scheduling domains. Much previous research in systematic search app...
146
click to vote
DAC
2005
ACM
16 years 7 months ago
2005
ACM
Power minimization under variability is formulated as a rigorous statistical robust optimization program with a guarantee of power and timing yields. Both power and timing metrics...
205
Voted
PAMI
2012
13 years 8 months ago
2012
—The problem of automatic and optimal design of embedded object detector cascades is considered. Two main challenges are identified: optimization of the cascade configuration and...
151
click to vote
GLOBECOM
2009
IEEE
16 years 26 days ago
2009
IEEE
—In this paper, we study the joint power and channel resource allocation problem for a multiuser F/TDMA decodeand-forward (DF) relay network under per-node power constraints and ...
147
Voted
ICTAI
2006
IEEE
16 years 5 days ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...