Sciweavers

16404 search results - page 505 / 3281
» A set coverage problem
Sort
View
GLOBECOM
2010
IEEE
15 years 4 months ago
Dimming Cellular Networks
We propose a novel technique called dimming to improve the energy efficiency of cellular networks by reducing the capacity, services, and energy consumption of cells without turnin...
David Tipper, Abdelmounaam Rezgui, Prashant Krishn...
299
Voted
NFM
2011
335views Formal Methods» more  NFM 2011»
15 years 1 months ago
CORAL: Solving Complex Constraints for Symbolic PathFinder
Symbolic execution is a powerful automated technique for generating test cases. Its goal is to achieve high coverage of software. One major obstacle in adopting the technique in pr...
Matheus Souza, Mateus Borges, Marcelo d'Amorim, Co...
ICASSP
2011
IEEE
14 years 10 months ago
Network-MIMO backhauling for QOS-constrained relay transmission
1 A relay station (RS)-based cellular system deployment is considered, where multiple base stations (BS) cooperate in the BSRS in-band transmission for the downlink. With the joint...
Josep Vidal, Adrian Agustin, Sandra Lagen, Eduard ...
176
Voted
GECCO
2004
Springer
145views Optimization» more  GECCO 2004»
16 years 7 days ago
Automated Extraction of Problem Structure
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
Anthony Bucci, Jordan B. Pollack, Edwin D. de Jong
173
Voted
FOCS
2009
IEEE
16 years 1 months ago
The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Daniel Gottesman, Sandy Irani