Sciweavers

11740 search results - page 172 / 2348
» More Problems in Rewriting
Sort
View
ANOR
2011
117views more  ANOR 2011»
14 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
ICALP
2011
Springer
14 years 7 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...
ICML
2004
IEEE
16 years 5 months ago
Solving cluster ensemble problems by bipartite graph partitioning
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
Xiaoli Zhang Fern, Carla E. Brodley
PLDI
2010
ACM
16 years 1 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
CDC
2008
IEEE
126views Control Systems» more  CDC 2008»
15 years 11 months ago
Open and emerging control problems in tokamak plasma control
— The tokamak concept for magnetic confinement of fusion plasmas is now quite mature scientifically. This maturity is evidenced by the ongoing worldwide effort to design and cons...
M. L. Walker, Eugenio Schuster, Didier Mazon, Didi...