Sciweavers

2252 search results - page 234 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
16 years 1 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
15 years 5 months ago
A note on the nearest neighbor in growth-restricted metrics
In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...
Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...
CEC
2005
IEEE
15 years 9 months ago
A genetic algorithm for energy minimization in bio-molecular systems
Energy minimization algorithms for bio-molecular systems are critical to applications such as the prediction of protein folding. Conventional energy minimization methods such as th...
Xiaochun Weng, Lutz Hamel, Lenore M. Martin, Joan ...
WSC
2008
15 years 6 months ago
Enhanced Bandwidth-Delay Based Routing Algorithm for a packet-switched virtual call centre environment
Traditionally call centres were based on circuit-switched systems. But with the advancement of communication technologies, call centres have shifted to packet-switched systems. Th...
Akinbola Adetunji, Hadi Larijani
UAI
1996
15 years 5 months ago
Bucket elimination: A unifying framework for probabilistic inference
Probabilistic inference algorithms for belief updating, nding the most probable explanation, the maximum a posteriori hypothesis, and the maximum expected utility are reformulated...
Rina Dechter