Sciweavers

1101 search results - page 119 / 221
» Comparing Computer Models Solving Number Series Problems
Sort
View
PODC
2011
ACM
14 years 20 days ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
CP
2009
Springer
15 years 4 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
ICRA
2006
IEEE
110views Robotics» more  ICRA 2006»
15 years 3 months ago
Speeding-up Rao-blackwellized SLAM
— Recently, Rao-Blackwellized particle filters have become a popular tool to solve the simultaneous localization and mapping problem. This technique applies a particle filter i...
Giorgio Grisetti, Gian Diego Tipaldi, Cyrill Stach...
COLT
2006
Springer
15 years 1 months ago
Discriminative Learning Can Succeed Where Generative Learning Fails
Generative algorithms for learning classifiers use training data to separately estimate a probability model for each class. New items are classified by comparing their probabiliti...
Philip M. Long, Rocco A. Servedio
GECCO
2010
Springer
184views Optimization» more  GECCO 2010»
15 years 1 months ago
A mono surrogate for multiobjective optimization
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
Ilya Loshchilov, Marc Schoenauer, Michèle S...