Sciweavers

14518 search results - page 137 / 2904
» Two Problems for Sophistication
Sort
View
CP
2003
Springer
14 years 3 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 8 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan
INFOCOM
2007
IEEE
14 years 4 months ago
The Power Balancing Problem in Energy Constrained Multi-Hop Wireless Networks
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
Randeep Bhatia, Abhishek Kashyap, Erran L. Li
FC
2004
Springer
94views Cryptology» more  FC 2004»
14 years 3 months ago
The Ephemeral Pairing Problem
Abstract In wireless ad-hoc broadcast networks the pairing problem consists of establishing a (long-term) connection between two specific physical nodes in the network that do not...
Jaap-Henk Hoepman
HEURISTICS
2006
120views more  HEURISTICS 2006»
13 years 10 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet