893 search results - page 112 / 179 » P3C: A New Algorithm for the Simple Temporal Problem |
PDP
2005
IEEE
14 years 2 months ago
2005
IEEE
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
GECCO
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we address the problem of finding gene regulatory networks from experimental DNA microarray data. Different approaches to infer the dependencies of gene r...
COLT
2003
Springer
14 years 2 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
APPROX
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
DATE
2000
IEEE
14 years 1 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...