2924 search results - page 125 / 585 » Lower Bounds in Distributed Computing |
111
click to vote
JSAT
2006
15 years 19 days ago
2006
Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in PseudoBoolean...
94
Voted
IPPS
2000
IEEE
15 years 5 months ago
2000
IEEE
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
CP
2005
Springer
15 years 6 months ago
2005
Springer
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
90
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
117
click to vote
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...