Sciweavers

1258 search results - page 195 / 252
» Architecture-driven Problem Decomposition
Sort
View
SCHOLARPEDIA
2008
110views more  SCHOLARPEDIA 2008»
13 years 8 months ago
Luce's choice axiom
A geometric approach is introduced to explain phenomena that can arise with Luce's choice axiom; e.g., differences occur when determining the likelihood of a ranking by start...
Duncan Luce
CP
2010
Springer
13 years 7 months ago
Generating Special-Purpose Stateless Propagators for Arbitrary Constraints
Given an arbitrary constraint c on n variables with domain size d, we show how to generate a custom propagator that establishes GAC in time O(nd) by precomputing the propagation th...
Ian P. Gent, Christopher Jefferson, Ian Miguel, Pe...
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
13 years 7 months ago
Multiple depth/presence sensors: Integration and optimal placement for human/robot coexistence
— Depth and presence sensors are used to prevent collisions in environments where human/robot coexistence is relevant. To address the problem of occluded areas, we extend in this...
Fabrizio Flacco, Alessandro De Luca
PRL
2010
105views more  PRL 2010»
13 years 7 months ago
Quasi-random nonlinear scale space
A novel nonlinear scale space framework is proposed for the purpose of multiscale image representation. The scale space decomposition problem is formulated as a general Bayesian l...
Akshaya Kumar Mishra, Alexander Wong, David A. Cla...
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 7 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer