Sciweavers

1451 search results - page 137 / 291
» Order independence and rationalizability
Sort
View
CORR
2000
Springer
120views Education» more  CORR 2000»
15 years 6 months ago
Scaling Up Inductive Logic Programming by Learning from Interpretations
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
Hendrik Blockeel, Luc De Raedt, Nico Jacobs, Bart ...
ENTCS
2002
134views more  ENTCS 2002»
15 years 6 months ago
Implementing Compositional Analysis Using Intersection Types With Expansion Variables
A program analysis is compositional when the analysis result for a particular program fragment is obtained solely from the results for its immediate subfragments via some composit...
Assaf J. Kfoury, Geoffrey Washburn, Joe Wells
AMAI
1999
Springer
15 years 6 months ago
STCSP - Structured Temporal Constraint satisfaction Problems
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
Mira Balaban, Tzachi Rosen
IOR
2002
135views more  IOR 2002»
15 years 6 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss
CN
1999
116views more  CN 1999»
15 years 6 months ago
Network-conscious GIF image transmission over the Internet
Traditional image compression techniques seek the smallest possible le size for a given level of image quality. By contrast, network-conscious image compression techniques take in...
Paul D. Amer, Sami Iren, Gul E. Sezen, Phillip T. ...