Sciweavers

2905 search results - page 113 / 581
» Formal Memetic Algorithms
Sort
View
143
Voted
MKM
2007
Springer
15 years 10 months ago
Biform Theories in Chiron
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
William M. Farmer
168
Voted
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 6 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad
TKDE
2012
226views Formal Methods» more  TKDE 2012»
13 years 6 months ago
DDD: A New Ensemble Approach for Dealing with Concept Drift
—Online learning algorithms often have to operate in the presence of concept drifts. A recent study revealed that different diversity levels in an ensemble of learning machines a...
Leandro L. Minku, Xin Yao
PLDI
2006
ACM
15 years 10 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
JAIR
2008
110views more  JAIR 2008»
15 years 3 months ago
Completeness and Performance Of The APO Algorithm
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...
Tal Grinshpoun, Amnon Meisels