Sciweavers

3937 search results - page 496 / 788
» Questioning Ubiquitous Computing
Sort
View
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 10 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
Samir Siksek, Michael Stoll
ICLP
2010
Springer
15 years 10 months ago
Implementation Alternatives for Bottom-Up Evaluation
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
Stefan Brass
FMCAD
2004
Springer
15 years 10 months ago
A Partitioning Methodology for BDD-Based Verification
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
Debashis Sahoo, Subramanian K. Iyer, Jawahar Jain,...
ECML
2006
Springer
15 years 10 months ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 10 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom