Sciweavers

7773 search results - page 1457 / 1555
» On generalized Frame-Stewart numbers
Sort
View
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
14 years 1 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...
ATAL
2006
Springer
14 years 1 months ago
A context-aware approach for service selection using ontologies
Selecting the right parties to interact with is a fundamental problem in open and dynamic environments. The problem is exemplified when the number of interacting parties is high a...
Murat Sensoy, Pinar Yolum
CSCW
2004
ACM
14 years 1 months ago
Putting systems into place: a qualitative study of design requirements for location-aware community systems
We present a conceptual framework for location-aware community systems and results from two studies of how sociallydefined places influence people's information sharing and c...
Quentin Jones, Sukeshini A. Grandhi, Steve Whittak...
BIRTHDAY
2006
Springer
14 years 1 months ago
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
Richard M. Karp, Till Nierhoff, Till Tantau
DAC
2004
ACM
14 years 1 months ago
Practical repeater insertion for low power: what repeater library do we need?
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
Xun Liu, Yuantao Peng, Marios C. Papaefthymiou
« Prev « First page 1457 / 1555 Last » Next »