Sciweavers

706 search results - page 88 / 142
» Super Solutions in Constraint Programming
Sort
View
CDC
2009
IEEE
124views Control Systems» more  CDC 2009»
14 years 9 months ago
A graph-theoretic approach to distributed control over networks
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
John Swigart, Sanjay Lall
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 days ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ICTAI
2008
IEEE
15 years 6 months ago
Finding Good Starting Points for Solving Structured and Unstructured Nonlinear Constrained Optimization Problems
In this paper, we develop heuristics for finding good starting points when solving large-scale nonlinear constrained optimization problems (COPs). We focus on nonlinear programmi...
Soomin Lee, Benjamin W. Wah
ISCAS
2006
IEEE
102views Hardware» more  ISCAS 2006»
15 years 5 months ago
A low power merge cell processor for real-time spike sorting in implantable neural prostheses
Extremely low power consumption is the critical constraint for designing implantable neural decoders that inter- Desired face directly with the nervous system. Typically a system w...
M. D. Linderman, T. H. Meng
IMA
2005
Springer
127views Cryptology» more  IMA 2005»
15 years 5 months ago
On the Automatic Construction of Indistinguishable Operations
Abstract. An increasingly important design constraint for software running on ubiquitous computing devices is security, particularly against physical methods such as side-channel a...
Manuel Barbosa, Dan Page