13214 search results - page 327 / 2643 » Pseudorandomness for network algorithms |
169
click to vote
COR
2007
15 years 6 months ago
2007
The p-center problem is to locate p facilities in a network of n demand points so as to minimize the longest distance between a demand point and its nearest facility. We consider ...
150
click to vote
JEC
2006
15 years 6 months ago
2006
The set of frames exchanged in automotive applications must meet two constraints: it has to be feasible from a schedulability point of view and it should minimize the network bandw...
185
click to vote
IJICT
2007
15 years 6 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...
180
click to vote
AICOM
2004
15 years 6 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
290
click to vote
IWANN
2011
Springer
14 years 9 months ago
2011
Springer
In recent years, the increasing interest in fuzzy rough set theory has allowed the definition of novel accurate methods for feature selection. Although their stand-alone applicati...