620 search results - page 65 / 124 » A Simple and Fast Min-cut Algorithm |
105
click to vote
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
We study non-overlapping axis-parallel packings of 3D boxes with profits into a dedicated bigger box where rotation is either forbidden or permitted; we wish to maximize the total...
IPSN
2003
Springer
15 years 5 months ago
2003
Springer
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
101
click to vote
WECWIS
2002
IEEE
15 years 4 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS...