Sciweavers

1788 search results - page 246 / 358
» The Language of Search
Sort
View
CP
2004
Springer
14 years 3 months ago
Quality of LP-Based Approximations for Highly Combinatorial Problems
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
Lucian Leahu, Carla P. Gomes
CP
2004
Springer
14 years 3 months ago
Challenges for Constraint Programming in Networking
In this talk we present a number of problems for network design, planning and analysis and show how they can be addressed with different hybrid CP solutions. Clearly, this problem...
Helmut Simonis
ICALP
2004
Springer
14 years 3 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
Christoph Dürr, Mark Heiligman, Peter H&oslas...
IFIP
2004
Springer
14 years 3 months ago
GPS-Based Route Discovery Algorithms for On-Demand Routing Protocols in MANETs
Abstract. This papers presents new Global Positioning System (GPS)based route discovery algorithms for on-demand routing in MANETs, called Position-based Selective Flooding (PSF). ...
Mehran Abolhasan, Tadeusz A. Wysocki
IFIP
2004
Springer
14 years 3 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel