4524 search results - page 341 / 905 » The Complexity of Global Constraints |
159
click to vote
DATE
2002
IEEE
15 years 12 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
181
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— We consider a distributed system modeled as a possibly large network of automata. Planning in this system consists in selecting and organizing actions in order to reach a goal ...
208
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
163
click to vote
SRDS
2000
IEEE
15 years 11 months ago
2000
IEEE
Validation of distributed systems using fault injection is difficult because of their inherent complexity, lack of a global clock, and lack of an easily accessible notion of a gl...
165
click to vote
ATAL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. Recent research has provided methods for coordinating the individually formed concurrent hierarchical plans (CHiPs) of a group of agents in a shared environment. A reason...