Sciweavers

1047 search results - page 161 / 210
» Learning the required number of agents for complex tasks
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
13 years 7 months ago
Genetic Programming, Validation Sets, and Parsimony Pressure
Fitness functions based on test cases are very common in Genetic Programming (GP). This process can be assimilated to a learning task, with the inference of models from a limited n...
Christian Gagné, Marc Schoenauer, Marc Pari...
GECCO
2008
Springer
115views Optimization» more  GECCO 2008»
13 years 8 months ago
A genetic programming approach to business process mining
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
Chris J. Turner, Ashutosh Tiwari, Jörn Mehnen
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
14 years 1 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
CDVE
2007
Springer
136views Visualization» more  CDVE 2007»
14 years 1 months ago
Cooperative Validation in Distributed Control Systems Design
The team of engineers designing and implementing distributed control system software must communicate within a multidisciplinary environment. One of the main problems is the intera...
Dariusz Choinski, Mieczyslaw Metzger, Witold Nocon...
ICRE
1996
IEEE
13 years 12 months ago
A facilitator method for upstream design activities with diverse stakeholders
This paper presents a method that can be used for the elicitation and speci cation of requirements and high-level design. It supports stakeholder-based modeling, rapid feasibility...
Regina M. Gonzales, Alexander L. Wolf