Sciweavers

4940 search results - page 429 / 988
» On the Complexity of Universal Programs
Sort
View
PDPTA
2000
15 years 8 months ago
A Reusable Software Framework for Distributed Decision-Making Protocols
Developers of programs for distributed systems spend considerable time designing solutions to various complex decision-making problems. The work described in this paper applies th...
Sudharshan Vazhkudai, H. Conrad Cunningham
CODAS
1996
63views more  CODAS 1996»
15 years 8 months ago
Semantic Modeling of Successive Events Applied to Version Management
ntic abstractions classification, aggregation and generalization are extremely useful for modeling complex situations containing time-independent events. This paper shows that the...
J. H. ter Bekke
178
Voted
NIPS
1993
15 years 8 months ago
Structural and Behavioral Evolution of Recurrent Networks
This paper introduces GNARL, an evolutionary program which induces recurrent neural networks that are structurally unconstrained. In contrast to constructive and destructive algor...
Gregory M. Saunders, Peter J. Angeline, Jordan B. ...
SIAMJO
2008
93views more  SIAMJO 2008»
15 years 6 months ago
Smooth Optimization with Approximate Gradient
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
Alexandre d'Aspremont
SIMPAR
2010
110views Robotics» more  SIMPAR 2010»
15 years 5 months ago
Improving a Robotics Framework with Real-Time and High-Performance Features
Middleware has a key role in modern and object-oriented robotics frameworks, which aim at developing reusable, scalable and maintainable systems using different platforms and prog...
Jesús Martínez, Adrián Romero...