Sciweavers

2412 search results - page 102 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
ICASSP
2011
IEEE
14 years 7 months ago
Mixed-integer linear programming framework for max-min power control with single-stage interference cancellation
We consider a wireless network comprising a number of mutuallyinterfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference...
Eleftherios Karipidis, Di Yuan, Erik G. Larsson
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 3 months ago
Deploying Wireless Networks with Beeps
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
Alejandro Cornejo, Fabian Kuhn
CCGRID
2002
IEEE
15 years 8 months ago
Overcoming the Problems Associated with the Existence of Too Many DSM APIs
Despite the large research efforts in the SW–DSM community, this technology has not yet been adapted widely for significant codes beyond benchmark suites. One of the reasons co...
Martin Schulz
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 7 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
GIS
2004
ACM
16 years 4 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...