1135 search results - page 10 / 227 » Interactive Problem Solving via Algorithm Visualization |
96
Voted
DAC
2008
ACM
16 years 20 days ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
94
Voted
UIST
2006
ACM
15 years 5 months ago
2006
ACM
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
98
Voted
JNW
2007
14 years 11 months ago
2007
— Wireless sensor networks offer the potential to significantly improve the performance of pursuers in pursuit-evasion games. In this paper, we study several sensor network syst...
IPMI
1999
Springer
16 years 15 days ago
1999
Springer
Abstract. Inter-subjectnon-rigid registration of cortical anatomical structures as seen in MR is a challenging problem. The variability of the sulcal and gyral patterns across pati...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...