Sciweavers

757 search results - page 94 / 152
» On the hardness of approximating Max-Satisfy
Sort
View
WADS
2001
Springer
113views Algorithms» more  WADS 2001»
15 years 2 months ago
Movement Planning in the Presence of Flows
This paper investigates the problem of time-optimum movement planning in two and three dimensions for a point robot which has bounded control velocity through a set of n polygonal...
John H. Reif, Zheng Sun
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 18 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
SODA
1998
ACM
106views Algorithms» more  SODA 1998»
14 years 11 months ago
Greedy Strikes Back: Improved Facility Location Algorithms
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
Sudipto Guha, Samir Khuller
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
14 years 11 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ECCC
2008
108views more  ECCC 2008»
14 years 10 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans