Sciweavers

3333 search results - page 279 / 667
» Optimal Power-Down Strategies
Sort
View
ICVS
1999
Springer
15 years 11 months ago
ADORE: Adaptive Object Recognition
Many modern computer vision systems are built by chaining together standard vision procedures, often in graphical programming environments such as Khoros, CVIPtools or IUE. Typical...
Bruce A. Draper, José Bins, Kyungim Baek
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
15 years 10 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
CP
2008
Springer
15 years 8 months ago
Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
Abstract. Finding feasible points for which the proof succeeds is a critical issue in safe Branch and Bound algorithms which handle continuous problems. In this paper, we introduce...
Alexandre Goldsztejn, Yahia Lebbah, Claude Michel,...
AAAI
2004
15 years 8 months ago
Dynamic Programming for Partially Observable Stochastic Games
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
Eric A. Hansen, Daniel S. Bernstein, Shlomo Zilber...
FLAIRS
2003
15 years 8 months ago
Cost-Based Policy Mapping for Imitation
Imitation represents a powerful approach for programming and autonomous learning in robot and computer systems. An important aspect of imitation is the mapping of observations to ...
Srichandan V. Gudla, Manfred Huber