Sciweavers

8413 search results - page 116 / 1683
» Ordering Problem Subgoals
Sort
View
CSCLP
2006
Springer
13 years 12 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
14 years 2 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
DAM
2007
100views more  DAM 2007»
13 years 8 months ago
Memory management optimization problems for integrated circuit simulators
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
Timothée Bossart, Alix Munier Kordon, Franc...
HICSS
2000
IEEE
136views Biometrics» more  HICSS 2000»
14 years 17 days ago
Ordered End-to-End Multicast for Distributed Multimedia Systems
We address the problem of message ordering for reliable multicast communication. End-to-end multicast ordering is useful for ensuring the collective integrity and consistency of d...
Hans-Peter Dommel, J. J. Garcia-Luna-Aceves
SODA
2010
ACM
155views Algorithms» more  SODA 2010»
14 years 5 months ago
A Space--Time Tradeoff for Permutation Problems
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
Mikko Koivisto, Pekka Parviainen