Sciweavers

16430 search results - page 383 / 3286
» On Computable Tree Functions
Sort
View
CSR
2007
Springer
16 years 27 days ago
Inverting Onto Functions and Polynomial Hierarchy
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
16 years 1 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
180
Voted
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
16 years 27 days ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
179
Voted
IFL
2003
Springer
144views Formal Methods» more  IFL 2003»
15 years 12 months ago
Building an Interface Between Eden and Maple: A Way of Parallelizing Computer Algebra Algorithms
Eden is a parallel functional language extending Haskell with processes. This paper describes the implementation of an interface between the Eden language and the Maple system. The...
Rafael Martínez, Ricardo Pena
175
Voted
HICSS
1994
IEEE
149views Biometrics» more  HICSS 1994»
15 years 11 months ago
Stochastic Problem Solving by Local Computation Based on Self-Organization Paradigm
We are developing a new problem-solving methodology based on a self-organization paradigm. To realize our future goal of self-organizing computational systems, we have to study co...
Yasusi Kanada, Masao Hirokawa