2446 search results - page 132 / 490 » Choiceless Polynomial Time |
100
Voted
CISS
2008
IEEE
15 years 7 months ago
2008
IEEE
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...
97
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
102
Voted
CIS
2004
Springer
15 years 6 months ago
2004
Springer
For finding accurate and biologically meaningful multiple sequence alignment, it is required to consider a loosely constrained version of multiple sequence alignment. This paper is...
FORMATS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
84
Voted
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we consider the problem of scheduling independent identical tasks on heterogeneous processors where communication times and processing times are different. We assum...