Sciweavers

1644 search results - page 97 / 329
» Finding Dominators in Practice
Sort
View
CCR
2005
101views more  CCR 2005»
13 years 8 months ago
Design choices for content distribution in P2P networks
Content distribution using the P2P paradigm has become one of the most dominant services in the Internet today. Most of the research effort in this area focuses on developing new ...
Anwar Al Hamra, Pascal Felber
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 8 months ago
Algorithmic Theories of Everything
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...
Jürgen Schmidhuber
IPM
2000
96views more  IPM 2000»
13 years 8 months ago
Further reflections on TREC
The paper reviews the TREC Programme up to TREC-6 (1997), considering the test results, the substantive findings for IR that follow, and the lessons TREC offers for IR evaluation....
Karen Sparck Jones
DAM
1999
128views more  DAM 1999»
13 years 8 months ago
Graph Classes Between Parity and Distance-hereditary Graphs
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
Serafino Cicerone, Gabriele Di Stefano
SCHEDULING
2008
152views more  SCHEDULING 2008»
13 years 8 months ago
Bicriteria robotic cell scheduling
This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where ...
Hakan Gultekin, M. Selim Akturk, Oya Ekin Karasan