Sciweavers

3071 search results - page 563 / 615
» Explanatory Design Theory
Sort
View
ATAL
2009
Springer
15 years 6 months ago
Characterizing false-name-proof allocation rules in combinatorial auctions
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....
Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sa...
CIKM
2009
Springer
15 years 6 months ago
Using multiple ontologies in information extraction
Ontology-Based Information Extraction (OBIE) has recently emerged as a subfield of Information Extraction (IE). Here, ontologies - which provide formal and explicit specificatio...
Daya C. Wimalasuriya, Dejing Dou
GECCO
2009
Springer
15 years 6 months ago
Dynamic evolutionary optimisation: an analysis of frequency and magnitude of change
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
Philipp Rohlfshagen, Per Kristian Lehre, Xin Yao
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
15 years 6 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...
OOPSLA
2009
Springer
15 years 6 months ago
Reimagining literate programming
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
James Dean Palmer, Eddie Hillenbrand