Sciweavers

811 search results - page 59 / 163
» Refactoring Using Type Constraints
Sort
View
POPL
2005
ACM
14 years 9 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
ICDE
2008
IEEE
182views Database» more  ICDE 2008»
14 years 10 months ago
A Generic Framework for Continuous Motion Pattern Query Evaluation
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
Petko Bakalov, Vassilis J. Tsotras
VLDB
2007
ACM
147views Database» more  VLDB 2007»
14 years 9 months ago
A General Framework for Modeling and Processing Optimization Queries
An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization ...
Michael Gibas, Ning Zheng, Hakan Ferhatosmanoglu
IJCAI
1989
13 years 10 months ago
Constrained Heuristic Search
Cognitive architectures aspire for generality both in terms of problem solving and learning across a range of problems, yet to date few examples of domain independent learning has...
Mark S. Fox, Norman M. Sadeh, Can A. Baykan
PODS
1999
ACM
160views Database» more  PODS 1999»
14 years 1 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv