Sciweavers

350 search results - page 43 / 70
» What's in a Name
Sort
View
STACS
1997
Springer
14 years 2 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
14 years 1 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
CAISE
2006
Springer
14 years 1 months ago
Describing Interoperability: the OoI Ontology
Abstract. Though ontologies are widely used to solve some specific interoperability problems, there is no specific ontology defining what interoperability actually is, independentl...
Yannick Naudet, Thibaud Latour, Kevin Hausmann, Sv...
ICS
2000
Tsinghua U.
14 years 1 months ago
Characterizing processor architectures for programmable network interfaces
The rapid advancements of networking technology have boosted potential bandwidth to the point that the cabling is no longer the bottleneck. Rather, the bottlenecks lie at the cros...
Patrick Crowley, Marc E. Fiuczynski, Jean-Loup Bae...
AAAI
2007
14 years 5 days ago
Allocating Goods on a Graph to Eliminate Envy
We introduce a distributed negotiation framework for multiagent resource allocation where interactions between agents are limited by a graph defining a negotiation topology. A gr...
Yann Chevaleyre, Ulrich Endriss, Nicolas Maudet