Sciweavers

28888 search results - page 407 / 5778
» Computability and complexity in analysis
Sort
View
WOA
2001
15 years 8 months ago
Enlightened Agents in TuCSoN
Abstract--In the network-centric computing era, applications often involve sets of autonomous, unpredictable, and possibly mobile entities interacting within open, dynamic, and pos...
Alessandro Ricci, Andrea Omicini, Enrico Denti
JUCS
2000
135views more  JUCS 2000»
15 years 6 months ago
The Price of Routing in FPGAs
: Studying the architectural evolution of mainstream field programmable gate arrays (FPGAs) leads to the following remark: in these circuits, the proportion of silicon devoted to r...
Florent de Dinechin
COMPGEOM
2010
ACM
15 years 12 months ago
Approximating loops in a shortest homology basis from point data
Inference of topological and geometric attributes of a hidden manifold from its point data is a fundamental problem arising in many scientific studies and engineering application...
Tamal K. Dey, Jian Sun, Yusu Wang
ESCIENCE
2006
IEEE
15 years 10 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans
GECCO
2006
Springer
137views Optimization» more  GECCO 2006»
15 years 10 months ago
Inside a predator-prey model for multi-objective optimization: a second study
In this article, new variation operators for evolutionary multiobjective algorithms (EMOA) are proposed. On the basis of a predator-prey model theoretical considerations as well a...
Christian Grimme, Karlheinz Schmitt