Sciweavers

1569 search results - page 182 / 314
» Programming contest strategy
Sort
View
PLDI
2003
ACM
14 years 4 months ago
Automatically proving the correctness of compiler optimizations
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
Sorin Lerner, Todd D. Millstein, Craig Chambers
SIGSOFT
2004
ACM
14 years 12 months ago
Heuristic-guided counterexample search in FLAVERS
One of the benefits of finite-state verification (FSV) tools, such as model checkers, is that a counterexample is provided when the property cannot be verified. Not all counterexa...
Jianbin Tan, George S. Avrunin, Lori A. Clarke, Sh...
ATAL
2008
Springer
14 years 1 months ago
Adaptive multi-robot wide-area exploration and mapping
The exploration problem is a central issue in mobile robotics. A complete terrain coverage is not practical if the environment is large with only a few small hotspots. This paper ...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
MIR
2010
ACM
207views Multimedia» more  MIR 2010»
13 years 9 months ago
Learning to rank for content-based image retrieval
In Content-based Image Retrieval (CBIR), accurately ranking the returned images is of paramount importance, since users consider mostly the topmost results. The typical ranking st...
Fabio F. Faria, Adriano Veloso, Humberto Mossri de...
JSS
2011
103views more  JSS 2011»
13 years 2 months ago
XML-manipulating test case prioritization for XML-manipulating services
: A web service may evolve autonomously, making peer web services in the same service composition uncertain as to whether the evolved behaviors are compatible with its original col...
Lijun Mei, W. K. Chan, T. H. Tse, Robert G. Merkel