Sciweavers

324 search results - page 56 / 65
» Distance Approximating Trees: Complexity and Algorithms
Sort
View
CEC
2007
IEEE
13 years 9 months ago
Fitness inheritance in evolutionary and multi-objective high-level synthesis
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
IPSN
2009
Springer
14 years 2 months ago
Distributed resource management and matching in sensor networks
We consider a scenario in which there are resources at or near nodes of a network, which are either static (e.g. fire stations, parking spots) or mobile (e.g. police cars). Over ...
Jie Gao, Leonidas J. Guibas, Nikola Milosavljevic,...
ICC
2007
IEEE
143views Communications» more  ICC 2007»
14 years 1 months ago
An Improved Joint M-Algorithm for Single Antenna Interference Cancellation in TDMA Mobile Radio
— We target M-ary data sequence estimation over time-variant frequency selective fading channels subject to cochannel interference (CCI). A novel joint reduced state sequence est...
Thorben Detert, Romain Drauge
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 9 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm