Sciweavers

6300 search results - page 18 / 1260
» We have it easy, but do we have it right
Sort
View
NIPS
2007
13 years 10 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
13 years 9 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
SLS
2007
Springer
100views Algorithms» more  SLS 2007»
14 years 2 months ago
EasySyn++: A Tool for Automatic Synthesis of Stochastic Local Search Algorithms
Abstract. We present a software tool, called EasySyn++, for the automatic synthesis of the source code for a set of stochastic local search (SLS) algorithms. EasySyn++ uses C++ as ...
Luca Di Gaspero, Andrea Schaerf
3DPVT
2004
IEEE
107views Visualization» more  3DPVT 2004»
14 years 7 days ago
An Easy Viewer for Out-of-Core Visualization of Huge Point-Sampled Models
In this paper, we propose a viewer for huge point-sampled models by combining out-of-core technologies with view-dependent level-of-detail (LOD) control. This viewer is designed o...
Fang Meng, Hongbin Zha
DLT
2003
13 years 10 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer