Sciweavers

2071 search results - page 234 / 415
» An Empirical Evaluation of LFG-DOP
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
14 years 11 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
KBSE
2010
IEEE
14 years 11 months ago
A program differencing algorithm for verilog HDL
During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because existing p...
Adam Duley, Chris Spandikow, Miryung Kim
TOMS
2010
106views more  TOMS 2010»
14 years 11 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CIKM
2010
Springer
14 years 11 months ago
Web search solved?: all result rankings the same?
The objective of this work is to derive quantitative statements about what fraction of web search queries issued to the state-of-the-art commercial search engines lead to excellen...
Hugo Zaragoza, Berkant Barla Cambazoglu, Ricardo A...
EMNLP
2010
14 years 11 months ago
Exploiting Conversation Structure in Unsupervised Topic Segmentation for Emails
This work concerns automatic topic segmentation of email conversations. We present a corpus of email threads manually annotated with topics, and evaluate annotator reliability. To...
Shafiq R. Joty, Giuseppe Carenini, Gabriel Murray,...