4066 search results - page 345 / 814 » Almost Complete Sets |
187
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
179
click to vote
HPDC
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract Metacomputing is the seamless application of geographically-separated distributed computing resources to user applications. We consider the scheduling of metaapplications;...
245
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
174
click to vote
JGT
2011
15 years 1 months ago
2011
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
170
Voted
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
What does a blind entity need in order to determine the geometry of the set of photocells that it carries through a changing lightfield? In this paper, we show that very crude know...