Sciweavers

1300 search results - page 205 / 260
» Constraint satisfaction problems and global cardinality cons...
Sort
View
ASPDAC
2005
ACM
104views Hardware» more  ASPDAC 2005»
14 years 11 months ago
Speed and voltage selection for GALS systems based on voltage/frequency islands
Due to increasing clock speeds and shrinking technologies, distributing a single global clock signal throughout a chip is becoming a difficult and challenging proposition. In this...
Koushik Niyogi, Diana Marculescu
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
14 years 10 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
COR
2008
97views more  COR 2008»
14 years 9 months ago
To be fair or efficient or a bit of both
Introducing a new concept of (, )-fairness, which allows for a bounded fairness compromise, so that a source is allocated a rate neither less than 0 1, nor more than 1, times...
Moshe Zukerman, Musa Mammadov, Liansheng Tan, Irad...
ICASSP
2008
IEEE
15 years 4 months ago
Learning to satisfy
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
Frederic Thouin, Mark Coates, Brian Eriksson, Robe...
ATAL
2006
Springer
15 years 1 months ago
Examining DCSP coordination tradeoffs
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
Michael Benisch, Norman M. Sadeh