306 search results - page 58 / 62 » On the Minimal Uncompletable Word Problem |
140
click to vote
WADS
1993
Springer
15 years 6 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
121
Voted
CN
2010
15 years 1 months ago
2010
In the current Internet picture more than 70% of the hosts are located behind Network Address Translators (NATs). This is not a problem in the client/server paradigm. However, the...
137
Voted
CPHYSICS
2006
15 years 1 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...
114
click to vote
IOR
2006
15 years 1 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
109
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Consider the following file caching problem: in response to a sequence of requests for files, where each file has a specified size and retrieval cost, maintain a cache of files of ...