Sciweavers

493 search results - page 92 / 99
» types 1998
Sort
View
78
Voted
RANDOM
1998
Springer
15 years 2 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
100
Voted
VLDB
1998
ACM
180views Database» more  VLDB 1998»
15 years 2 months ago
Active Storage for Large-Scale Data Mining and Multimedia
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using t...
Erik Riedel, Garth A. Gibson, Christos Faloutsos
86
Voted
GECCO
2000
Springer
122views Optimization» more  GECCO 2000»
15 years 1 months ago
Genetic Programming with Statically Scoped Local Variables
This paper presents an extension to genetic programming to allow the evolution of programs containing local variables with static scope which obey the invariant that all variables...
Evan Kirshenbaum
AAAI
1998
14 years 11 months ago
Leveled Commitment Contracts with Myopic and Strategic Agents
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agent...
Martin Andersson, Tuomas Sandholm
74
Voted
AAAI
1998
14 years 11 months ago
Probabilistic Frame-Based Systems
Two of the most important threads of work in knowledge representation today are frame-based representation systems (FRS's) and Bayesian networks (BNs). FRS's provide an ...
Daphne Koller, Avi Pfeffer