Sciweavers

1197 search results - page 124 / 240
» Which Dynamic Constraint Problems Can Be Solved By Ants
Sort
View
CDC
2009
IEEE
130views Control Systems» more  CDC 2009»
14 years 1 months ago
Modal and transition dwell time computation in switching systems: a set-theoretic approach
We consider a plant the dynamics of which switch among a family of systems. Each of these systems has a single stable equilibrium point. We assume that a constraint region for the...
Franco Blanchini, Daniele Casagrande, Stefano Mian...
CPAIOR
2006
Springer
14 years 3 hour ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
WSC
2008
13 years 10 months ago
Knowledge-based event control for flow-shops using simulation and rules
The requirements on production systems and their planning and control systems are constantly growing. Systems have to be flexible and provide viable solutions at the same time. Di...
Mark Aufenanger, Wilhelm Dangelmaier, Christoph La...
ICCS
2005
Springer
14 years 1 months ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak
ACCV
2010
Springer
13 years 10 months ago
Ghost-free High Dynamic Range Imaging
Most high dynamic range image (HDRI) algorithms assume stationary scene for registering multiple images which are taken under different exposure settings. In practice, however, the...
Yong Seok Heo (Seoul National University), Kyoung ...