Sciweavers

1951 search results - page 312 / 391
» An algorithm for improving graph partitions
Sort
View
AAAI
2007
15 years 6 months ago
Dynamic DFS Tree in ADOPT-ing
Several distributed constraint reasoning algorithms employ Depth First Search (DFS) trees on the constraint graph that spans involved agents. In this article we show that it is po...
Marius-Calin Silaghi, Makoto Yokoo
COMBINATORICS
2004
115views more  COMBINATORICS 2004»
15 years 4 months ago
Dense Packings of Equal Spheres in a Cube
We describe an adaptation of the billiard algorithm for finding dense packings of equal spheres inside a domain of the euclidean space. In order to improve the convergence of this...
Thierry Gensane
144
Voted
NIPS
2008
15 years 5 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson
ICDCIT
2005
Springer
15 years 9 months ago
Self-stabilizing Deterministic TDMA for Sensor Networks
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
Mahesh Arumugam, Sandeep S. Kulkarni
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 8 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu