Sciweavers

1684 search results - page 199 / 337
» The lexicographic decision function
Sort
View
86
Voted
SIGGRAPH
1993
ACM
15 years 4 months ago
Smooth transitions between bump rendering algorithms
A method is describedfor switching smoothly between rendering algorithms as required by the amount of visible surface detail. The result will be more realism with less computation...
Barry G. Becker, Nelson L. Max
ICML
1990
IEEE
15 years 4 months ago
Explanations of Empirically Derived Reactive Plans
Given an adequate simulation model of the task environment and payoff function that measures the quality of partially successful plans, competition-based heuristics such as geneti...
Diana F. Gordon, John J. Grefenstette
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
15 years 4 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
110
Voted
COMPSYSTECH
2007
15 years 4 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...
94
Voted
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
15 years 4 months ago
Adaptive evolution: an efficient heuristic for global optimization
This paper presents a novel evolutionary approach to solve numerical optimization problems, called Adaptive Evolution (AEv). AEv is a new micro-population-like technique because i...
Francisco Viveros Jiménez, Efrén Mez...