Sciweavers

1984 search results - page 125 / 397
» The colourful feasibility problem
Sort
View
ICRA
2010
IEEE
132views Robotics» more  ICRA 2010»
13 years 8 months ago
Sampling-based motion planning with temporal goals
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
FSTTCS
2009
Springer
14 years 2 months ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
WINE
2009
Springer
93views Economy» more  WINE 2009»
14 years 4 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
ATAL
2007
Springer
14 years 4 months ago
Distributed management of flexible times schedules
In this paper we consider the problem of managing and exploiting schedules in an uncertain and distributed environment. We assume a team of collaborative agents, each responsible ...
Stephen F. Smith, Anthony Gallagher, Terry L. Zimm...
PAMI
2010
112views more  PAMI 2010»
13 years 8 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum