2542 search results - page 112 / 509 » Computing Cartograms with Optimal Complexity |
127
click to vote
ICDCN
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
173
Voted
IJCAI
2003
2003
Towards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
15 years 4 months ago
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and...
142
click to vote
ARITH
2001
IEEE
15 years 7 months ago
2001
IEEE
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
141
click to vote
ICCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Phylogeny reconstruction from molecular data poses complex optimization problems: almost all optimization models are NP-hard and thus computationally intractable. Yet app...
142
Voted
BMCBI
2007
15 years 3 months ago
2007
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...