Sciweavers

4112 search results - page 387 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICRA
2002
IEEE
72views Robotics» more  ICRA 2002»
16 years 17 days ago
Distributed and Dynamic Task Reallocation in Robot Organizations
Task reallocation in a multi-robot organization is a process that distributes a decomposed global task to individual robots. This process must be distributed and dynamic because i...
Wei-Min Shen, Behnam Salemi
STOC
1994
ACM
95views Algorithms» more  STOC 1994»
15 years 11 months ago
Improved non-approximability results
We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
Mihir Bellare, Madhu Sudan
FLAIRS
1998
15 years 9 months ago
Decision Making in Qualitative Influence Diagrams
The increasing number of knowledge-based systems that build on a Bayesian belief network or influence diagram acknowledge the usefulness of these frameworks for addressing complex...
Silja Renooij, Linda C. van der Gaag
APPROX
2010
Springer
135views Algorithms» more  APPROX 2010»
15 years 7 months ago
Monotonicity Testing and Shortest-Path Routing on the Cube
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hy...
Jop Briët, Sourav Chakraborty, David Garc&iac...
PKDD
2005
Springer
138views Data Mining» more  PKDD 2005»
16 years 1 months ago
Indexed Bit Map (IBM) for Mining Frequent Sequences
Sequential pattern mining has been an emerging problem in data mining. In this paper, we propose a new algorithm for mining frequent sequences. It processes only one scan of the da...
Lionel Savary, Karine Zeitouni