Sciweavers

1888 search results - page 336 / 378
» Proof theory and computational analysis
Sort
View
SPAA
2009
ACM
14 years 3 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn
GECCO
2007
Springer
194views Optimization» more  GECCO 2007»
14 years 2 months ago
Hybrid coevolutionary algorithms vs. SVM algorithms
As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
Rui Li, Bir Bhanu, Krzysztof Krawiec
MICAI
2005
Springer
14 years 1 months ago
Agent-Based Simulation Replication: A Model Driven Architecture Approach
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...
Candelaria Sansores, Juan Pavón
NIPS
2007
13 years 10 months ago
The Tradeoffs of Large Scale Learning
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
Léon Bottou, Olivier Bousquet
COMPGEOM
2011
ACM
13 years 1 days ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...