Sciweavers

34170 search results - page 6452 / 6834
» Optimization
Sort
View
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
15 years 10 months ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
WDAG
2005
Springer
100views Algorithms» more  WDAG 2005»
15 years 10 months ago
The Dynamic And-Or Quorum System
We investigate issues related to the probe complexity of the And-Or quorum system and its implementation in a dynamic environment. Our contribution is twofold: We first analyze th...
Uri Nadav, Moni Naor
CP
2005
Springer
15 years 10 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
131
Voted
ACMICEC
2004
ACM
162views ECommerce» more  ACMICEC 2004»
15 years 10 months ago
Balanced matching of buyers and sellers in e-marketplaces: the barter trade exchange model
In this paper, we describe the operation of barter trade exchanges by identifying key techniques used by trade brokers to stimulate trade and satisfy member needs, and present alg...
Peter Haddawy, Namthip Rujikeadkumjorn, Khaimook D...
ASPLOS
2004
ACM
15 years 10 months ago
An ultra low-power processor for sensor networks
We present a novel processor architecture designed specifically for use in low-power wireless sensor-network nodes. Our sensor network asynchronous processor (SNAP/LE) is based on...
Virantha N. Ekanayake, Clinton Kelly IV, Rajit Man...
« Prev « First page 6452 / 6834 Last » Next »