Sciweavers

220 search results - page 25 / 44
» A Framework for Good Enough Testing
Sort
View
107
Voted
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
FCS
2006
14 years 11 months ago
The Representational Power of Conjunctive Normal Form
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
Thomas O'Neil, Jason Smith
AIPS
2009
14 years 10 months ago
Ant Search Strategies For Planning Optimization
In this paper a planning framework based on Ant Colony Optimization techniques is presented. It is well known that finding optimal solutions to planning problems is a very hard co...
Marco Baioletti, Alfredo Milani, Valentina Poggion...
62
Voted
EOR
2006
134views more  EOR 2006»
14 years 9 months ago
A smoothing heuristic for a bilevel pricing problem
In this paper, we provide a heuristic procedure, that performs well from a global optimality point of view, for an important and difficult class of bilevel programs. The algorithm...
Jean-Pierre Dussault, Patrice Marcotte, Séb...
ICC
2008
IEEE
115views Communications» more  ICC 2008»
15 years 4 months ago
Sliding-Window Algorithm for Asynchronous Cooperative Sensing in Wireless Cognitive Networks
—To improve the performance of spectrum sensing, cooperation among Cognitive Radios (CRs) has been proposed recently as an effective solution. Most existing works require either ...
Chengqi Song, Qian Zhang