5153 search results - page 741 / 1031 » Introduction to Randomized Algorithms |
117
click to vote
AIR
2004
15 years 3 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
134
click to vote
CORR
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
148
click to vote
DAM
2000
15 years 3 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
112
click to vote
SIGMETRICS
2002
ACM
15 years 3 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
149
click to vote
PAMI
2007
15 years 3 months ago
2007
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...