2430 search results - page 401 / 486 » Computing Tutte Polynomials |
124
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
126
Voted
FGR
2004
IEEE
15 years 7 months ago
2004
IEEE
The null space-based LDA takes full advantage of the null space while the other methods remove the null space. It proves to be optimal in performance. From the theoretical analysi...
130
click to vote
ESA
2000
Springer
15 years 6 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
115
click to vote
ICALP
2000
Springer
15 years 6 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
125
click to vote
MICCAI
2000
Springer
15 years 6 months ago
2000
Springer
New medical imaging modalities offering multi-valued data, such as phase contrast MRA and diffusion tensor MRI, require general representations for the development of automatized a...