Sciweavers

16404 search results - page 3003 / 3281
» A set coverage problem
Sort
View
203
Voted
PLDI
2004
ACM
15 years 10 months ago
Min-cut program decomposition for thread-level speculation
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
Troy A. Johnson, Rudolf Eigenmann, T. N. Vijaykuma...
SPAA
2004
ACM
15 years 10 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
CIKM
2004
Springer
15 years 10 months ago
Event threading within news topics
With the overwhelming volume of online news available today, there is an increasing need for automatic techniques to analyze and present news to the user in a meaningful and effi...
Ramesh Nallapati, Ao Feng, Fuchun Peng, James Alla...
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 10 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
166
Voted
KR
2004
Springer
15 years 10 months ago
Planning Graphs and Knowledge Compilation
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
Hector Geffner
« Prev « First page 3003 / 3281 Last » Next »