Sciweavers

6036 search results - page 118 / 1208
» Web search solved
Sort
View
STTT
2010
120views more  STTT 2010»
14 years 7 months ago
Solving the ignoring problem for partial order reduction
Abstract. Partial order reduction limits the state explosion problem that arises in model checking by limiting the exploration of redundant interleavings. A state space search algo...
Sami Evangelista, Christophe Pajault
SAC
2011
ACM
14 years 3 months ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
141
Voted
CADE
2012
Springer
13 years 3 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
124
Voted
ACL
2011
14 years 4 months ago
Piggyback: Using Search Engines for Robust Cross-Domain Named Entity Recognition
We use search engine results to address a particularly difficult cross-domain language processing task, the adaptation of named entity recognition (NER) from news text to web que...
Stefan Rüd, Massimiliano Ciaramita, Jens M&uu...
WWW
2009
ACM
16 years 1 months ago
Search result re-ranking based on gap between search queries and social tags
Both search engine click-through log and social annotation have been utilized as user feedback for search result re-ranking. However, to our best knowledge, no previous study has ...
Jun Yan, Ning Liu, Elaine Qing Chang, Lei Ji, Zhen...