Sciweavers

14704 search results - page 451 / 2941
» computing 2007
Sort
View
SARA
2007
Springer
15 years 11 months ago
Computing and Using Lower and Upper Bounds for Action Elimination in MDP Planning
Abstract. We describe a way to improve the performance of MDP planners by modifying them to use lower and upper bounds to eliminate non-optimal actions during their search. First, ...
Ugur Kuter, Jiaqiao Hu
TARK
2007
Springer
15 years 11 months ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
15 years 11 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
172
Voted
WINE
2007
Springer
151views Economy» more  WINE 2007»
15 years 11 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
EVOW
2007
Springer
15 years 9 months ago
An Evolutionary Approach to Computer-Aided Orchestration
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
Grégoire Carpentier, Damien Tardieu, G&eacu...