2109 search results - page 261 / 422 » Solving Necklace Constraint Problems |
142
click to vote
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
147
Voted
VLSID
1999
IEEE
15 years 9 months ago
1999
IEEE
A new approach for CMOS op-amp circuit synthesis has proposed here. The approach is based on the observation that the rst order behavior of a MOS transistor in the saturation regi...
124
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
185
click to vote
ECAI
1992
Springer
15 years 8 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
149
Voted
ESORICS
2010
Springer
15 years 5 months ago
2010
Springer
Collaborative optimization problems can often be modeled as a linear program whose objective function and constraints combine data from several parties. However, important applicat...