13841 search results - page 2500 / 2769 » Algorithms and Constraint Programming |
145
click to vote
STOC
2004
ACM
15 years 9 months ago
2004
ACM
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
136
click to vote
CSB
2003
IEEE
15 years 9 months ago
2003
IEEE
NMR resonance peak assignment is one of the key steps in solving an NMR protein structure. The assignment process links resonance peaks to individual residues of the target protei...
157
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
155
click to vote
CP
2000
Springer
15 years 8 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...
141
click to vote
STOC
1999
ACM
15 years 8 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...