Sciweavers

1995 search results - page 172 / 399
» What's the Problem
Sort
View
CPAIOR
2008
Springer
15 years 6 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 6 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
AAAI
2010
15 years 5 months ago
How Incomplete Is Your Semantic Web Reasoner?
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up com...
Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock...
APVIS
2007
15 years 5 months ago
Visualization of sanitized email logs for spam analysis
Email has become an integral method of communication. However, it is still plagued by vast amounts of spam. Many statistical techniques, such as Bayesian filtering, have been app...
Chris Muelder, Kwan-Liu Ma
IC
2008
15 years 5 months ago
mDNS - A Proposal for Hierarchical Multicast Session Directory Architecture
Bandwidth in the Internet is constantly increasing. The last mile problem of the Internet has almost been solved. Multimedia has emerged as a dominant type of traffic on the Intern...
Piyush Harsh, Richard Newman