Sciweavers

8413 search results - page 1122 / 1683
» Ordering Problem Subgoals
Sort
View
ICCBR
2001
Springer
15 years 11 months ago
Mining High-Quality Cases for Hypertext Prediction and Prefetching
Case-based reasoning aims to use past experience to solve new problems. A strong requirement for its application is that extensive experience base exists that provides statisticall...
Qiang Yang, Ian Tian Yi Li, Henry Haining Zhang
POPL
2000
ACM
15 years 11 months ago
Enforcing Trace Properties by Program Transformation
We propose an automatic method to enforce trace properties on programs. The programmer specifies the property separately from the program; a program transformer takes the program...
Thomas Colcombet, Pascal Fradet
SIGUCCS
2000
ACM
15 years 11 months ago
Automating Residence Hall Internet Signups
As colleges and universities are moving into the realm of providing Internet connections to the residence dormitories (ResNet), the local help desk is becoming the focal point for...
John R. Miller, Tom Peterson
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 11 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 11 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
« Prev « First page 1122 / 1683 Last » Next »