14548 search results - page 336 / 2910 » The Optimal Path-Matching Problem |
168
Voted
WAOA
2005
Springer
16 years 4 days ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
189
click to vote
GECCO
2007
Springer
16 years 25 days ago
2007
Springer
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
167
click to vote
AI
2010
Springer
15 years 6 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
161
click to vote
IAT
2007
IEEE
16 years 1 months ago
2007
IEEE
Optimal design is intractable in general. We identify a tractable class of design problems and propose the first framework for efficient, decision-theoretically optimal, collabo...
115
click to vote
CCCG
2010
15 years 8 months ago
2010
Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the 1-distance between the two labels in each labeling. We prese...