Sciweavers

5675 search results - page 157 / 1135
» Exploiting Chaos for Computation
Sort
View
148
Voted
ILP
2005
Springer
15 years 10 months ago
A Framework for Set-Oriented Computation in Inductive Logic Programming and Its Application in Generalizing Inverse Entailment
We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computati...
Héctor Corrada Bravo, David Page, Raghu Ram...
ISLPED
1997
ACM
99views Hardware» more  ISLPED 1997»
15 years 8 months ago
Low power data processing by elimination of redundant computations
We suggest a new technique to reduce energy consumption in the processor datapath without sacrificing performance by exploiting operand value locality at run time. Data locality is...
Mir Azam, Paul D. Franzon, Wentai Liu
114
Voted
AAAI
1998
15 years 5 months ago
On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems
In [4], Freuderdefines several types of interchangeability to capture the equivalenceamongthe valuesof a variable in a discrete constraint satisfaction problem(CSP), and provides ...
Berthe Y. Choueiry, Guevara Noubir
AIPS
1994
15 years 5 months ago
Solving Time-critical Decision-making Problems with Predictable Computational Demands
In this work we present an approach to solving time-critical decision-making problems by taking advantage of domain structure to expand the amountof time available for processing ...
Thomas Dean, Lloyd Greenwald
CCE
2004
15 years 4 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou