136 search results - page 26 / 28 » Experimental Study of Minimum Cut Algorithms |
CP
2000
Springer
15 years 2 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...
110
click to vote
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. With increase in number and size of VPNs, providers nee...
88
Voted
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
A common task in biological research is to predict function for proteins by comparing sequences between proteins of known and unknown function. This is often done using pair-wise ...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...