Sciweavers

2100 search results - page 355 / 420
» Fundamentals of the problem
Sort
View
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 2 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
KI
2005
Springer
14 years 2 months ago
Dependency Calculus: Reasoning in a General Point Relation Algebra
The point algebra is a fundamental formal calculus for spatial and temporal reasoning. We present a new generalization that meets all requirements to describe dependencies on netw...
Marco Ragni, Alexander Scivos
PREMI
2005
Springer
14 years 2 months ago
Computational Molecular Biology of Genome Expression and Regulation
Abstract. Technological advances in experimental and computational molecular biology have revolutionized the whole fields of biology and medicine. Large-scale sequencing, expressio...
Michael Q. Zhang
ISPD
2004
ACM
146views Hardware» more  ISPD 2004»
14 years 2 months ago
Power-aware clock tree planning
Modern processors and SoCs require the adoption of poweroriented design styles, due to the implications that power consumption may have on reliability, cost and manufacturability ...
Monica Donno, Enrico Macii, Luca Mazzoni
SPAA
2004
ACM
14 years 2 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...