Sciweavers

725 search results - page 30 / 145
» heuristics 2010
Sort
View
EOR
2007
108views more  EOR 2007»
13 years 10 months ago
How much information do we need?
ct 7 Modern technology is succeeding in delivering more information to people at ever faster rates. Under traditional 8 views of rational decision making where individuals should e...
Peter M. Todd
MANSCI
2010
92views more  MANSCI 2010»
13 years 8 months ago
A Quantitative Measurement of Regret Theory
This paper introduces a choice-based method that for the first time makes it possible to quantitatively measure regret theory, one of the most popular models of decision under unc...
Han Bleichrodt, Alessandra Cillo, Enrico Diecidue
PAAMS
2010
Springer
14 years 2 months ago
An UCT Approach for Anytime Agent-Based Planning
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
Damien Pellier, Bruno Bouzy, Marc Métivier
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 4 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
CORR
2010
Springer
137views Education» more  CORR 2010»
13 years 10 months ago
State Elimination Ordering Strategies: Some Experimental Results
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
Nelma Moreira, Davide Nabais, Rogério Reis