Sciweavers

7930 search results - page 679 / 1586
» Greedy in Approximation Algorithms
Sort
View
AAAI
2008
15 years 9 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...
EMSOFT
2008
Springer
15 years 9 months ago
Energy efficient streaming applications with guaranteed throughput on MPSoCs
In this paper we present a design space exploration flow to achieve energy efficiency for streaming applications on MPSoCs while meeting the specified throughput constraints. The ...
Jun Zhu, Ingo Sander, Axel Jantsch
LREC
2010
159views Education» more  LREC 2010»
15 years 8 months ago
Towards Optimal TTS Corpora
Unit selection text-to-speech systems currently produce very natural synthesized phrases by concatenating speech segments from a large database. Recently, increasing demand for de...
Didier Cadic, Cédric Boidin, Christophe d'A...
165
Voted
IJCAI
2007
15 years 8 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier
NIPS
2008
15 years 8 months ago
Fitted Q-iteration by Advantage Weighted Regression
Recently, fitted Q-iteration (FQI) based methods have become more popular due to their increased sample efficiency, a more stable learning process and the higher quality of the re...
Gerhard Neumann, Jan Peters