Sciweavers

4110 search results - page 153 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
IJCAI
1997
15 years 6 months ago
Learning to Improve both Efficiency and Quality of Planning
Most research in learning for planning has concentrated on efficiency gains. Another important goal is improving the quality of final plans. Learning to improve plan quality has b...
Tara A. Estlin, Raymond J. Mooney
ICCCN
2007
IEEE
15 years 11 months ago
An Energy-Efficient Scheduling Algorithm Using Dynamic Voltage Scaling for Parallel Applications on Clusters
In the past decade cluster computing platforms have been widely applied to support a variety of scientific and commercial applications, many of which are parallel in nature. Howev...
Xiaojun Ruan, Xiao Qin, Ziliang Zong, Kiranmai Bel...
CTRSA
2009
Springer
106views Cryptology» more  CTRSA 2009»
15 years 8 months ago
Communication-Efficient Private Protocols for Longest Common Subsequence
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
Matthew K. Franklin, Mark Gondree, Payman Mohassel
AAAI
2006
15 years 6 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
15 years 4 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant