Sciweavers

4103 search results - page 127 / 821
» Some results on the Collatz problem
Sort
View
CSSE
2002
IEEE
15 years 6 months ago
Characteristics of assured service and an alternative RIO scheme in differentiated services networks
Assured Service, a service model of Internet Differentiated Services (DiffServ) architecture, is not so well accommodated by the current Internet environment. This is because the I...
Seung-Joon Seok, Sung-Hyuck Lee, Jinwoo Park, Chul...
SUM
2007
Springer
16 years 20 days ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
STOC
2010
ACM
244views Algorithms» more  STOC 2010»
16 years 4 months ago
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
The P vs NP problem arose from the question of whether exhaustive search is necessary for problems with short verifiable solutions. We do not know if even a slight algorithmic imp...
Ryan Williams
CPM
1998
Springer
84views Combinatorics» more  CPM 1998»
15 years 10 months ago
Genome Halving
The Genome Halving Problem is motivated by the whole genome duplication events in molecular evolution that double the gene content of a genome and result in a perfect duplicated ge...
Nadia El-Mabrouk, Joseph H. Nadeau, David Sankoff
ESWS
2008
Springer
15 years 8 months ago
Microsearch: An Interface for Semantic Search
In this paper we discuss the potential for semantic search and focus on the most immediate problem toward its realization: the problem of the sparsity and relatively low quality of...
Peter Mika