Sciweavers

42738 search results - page 124 / 8548
» Search Computing Systems
Sort
View
AISC
2004
Springer
15 years 8 months ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
FOCS
1994
IEEE
15 years 7 months ago
A Spectral Approach to Lower Bounds
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
Bernard Chazelle
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
15 years 2 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 3 months ago
Transdichotomous Results in Computational Geometry, II: Offline Search
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
Timothy M. Chan, Mihai Patrascu