Sciweavers

234 search results - page 40 / 47
» First vs. best improvement: An empirical study
Sort
View
AMAI
2004
Springer
14 years 1 months ago
Warped Landscapes and Random Acts of SAT Solving
Recent dynamic local search (DLS) algorithms such as SAPS are amongst the state-of-the-art methods for solving the propositional satisfiability problem (SAT). DLS algorithms modi...
Dave A. D. Tompkins, Holger H. Hoos
WWW
2011
ACM
13 years 3 months ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
EUROPAR
2009
Springer
14 years 13 days ago
Surfing Peer-to-Peer IPTV: Distributed Channel Switching
It is now common for IPTV systems attracting millions of users to be based on a peer-to-peer (P2P) architecture. In such systems, each channel is typically associated with one P2P ...
Anne-Marie Kermarrec, Erwan Le Merrer, Yaning Liu,...
TCS
2008
13 years 8 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
JDCTA
2010
187views more  JDCTA 2010»
13 years 3 months ago
Automatic Verification of Security Properties in Remote Internet Voting Protocol with Applied Pi Calculus
Soundness and coercion resistance are the important and intricate security requirements for remote voting protocols. Several formal models of soundness and coercion-resistance hav...
Bo Meng, Wei Huang, Zimao Li, Dejun Wang