Sciweavers

428 search results - page 17 / 86
» An asynchronous complete method for distributed constraint o...
Sort
View
VLSID
2005
IEEE
116views VLSI» more  VLSID 2005»
14 years 9 months ago
A Quasi-Delay-Insensitive Method to Overcome Transistor Variation
Synchronous design methods have intrinsic performance overheads due to their use of the global clock and timing assumptions. In future manufacturing processes not only may it beco...
C. Brej, Jim D. Garside
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
14 years 2 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
CORR
2010
Springer
248views Education» more  CORR 2010»
13 years 8 months ago
Optimal Spectrum Sharing in MIMO Cognitive Radio Networks via Semidefinite Programming
Abstract--In cognitive radio (CR) networks with multipleinput multiple-output (MIMO) links, secondary users (SUs) can exploit "spectrum holes" in the space domain to acce...
Ying Jun Zhang, Anthony Man-Cho So
TSP
2008
92views more  TSP 2008»
13 years 8 months ago
Distributed Structures, Sequential Optimization, and Quantization for Detection
Abstract--In the design of distributed quantization systems one inevitably confronts two types of constraints--those imposed by a distributed system's structure and those impo...
Michael A. Lexa, Don H. Johnson
BROADNETS
2006
IEEE
14 years 2 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...