Sciweavers

4131 search results - page 585 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
ATAL
2009
Springer
16 years 1 months ago
Evaluating hybrid constraint tightening for scheduling agents
Hybrid Scheduling Problems (HSPs) combine temporal and finite-domain variables via hybrid constraints that dictate that specific bounds on temporal constraints rely on assignments...
James C. Boerkoel Jr., Edmund H. Durfee
DOCENG
2006
ACM
16 years 1 months ago
Comparing XML path expressions
XPath is the standard declarative language for navigating XML data and returning a set of matching nodes. In the context of XSLT/XQuery analysis, query optimization, and XML type ...
Pierre Genevès, Nabil Layaïda
191
Voted
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
16 years 1 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
16 years 17 days 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
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
16 years 10 days ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm