Sciweavers

137 search results - page 6 / 28
» On the number of local minima for the multidimensional assig...
Sort
View
TROB
2008
164views more  TROB 2008»
13 years 7 months ago
Dynamic Assignment in Distributed Motion Planning With Local Coordination
Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile senso...
Michael M. Zavlanos, George J. Pappas
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
AIPS
2007
13 years 10 months ago
Bounding the Resource Availability of Activities with Linear Resource Impact
We introduce the Linear Resource Temporal Network (LRTN), which consists of activities that consume or produce a resource, subject to absolute and relative metric temporal constra...
Jeremy Frank, Paul H. Morris
NIPS
2001
13 years 9 months ago
Spectral Relaxation for K-means Clustering
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
Hongyuan Zha, Xiaofeng He, Chris H. Q. Ding, Ming ...
DEXA
2007
Springer
89views Database» more  DEXA 2007»
14 years 1 months ago
Storing Multidimensional XML Documents in Relational Databases
Abstract. The problem of storing and querying XML data using relational databases has been considered a lot and many techniques have been developed. MXML is an extension of XML sui...
Nikolaos Fousteris, Manolis Gergatsoulis, Yannis S...