1816 search results - page 100 / 364 » A New Approach for Solving the Maximum Clique Problem |
169
click to vote
WECWIS
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, a generic optimization problem arising in supply chain design is modeled in a game theoretic framework and solved as a decentralized problem using a mechanism desig...
144
click to vote
NOMS
2008
IEEE
16 years 13 days ago
2008
IEEE
—In this paper∗ , we devise a novel method for bottleneck analysis of UDP networks based on the concept of network utility maximization. To determine the losses on the links in...
173
click to vote
CONSTRAINTS
2006
15 years 6 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
141
click to vote
DATE
2008
IEEE
16 years 15 days ago
2008
IEEE
We compare 12 new encodings for representing of FPGA detailed routing problems as equivalent Boolean Satisfiability (SAT) problems against the only 2 previously used encodings. We...
200
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...