Sciweavers

551 search results - page 9 / 111
» The Complexity of Andersen's Analysis in Practice
Sort
View
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
14 years 26 days ago
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
MTSR
2007
Springer
14 years 25 days ago
The Human Art of Encoding: Markup as Documentary Practice
This paper describes the Markup Analysis Project, a research initiative of the Information Policy and Practice Research Group at the University of Sydney to investigate frameworks ...
Paul Scifleet, Susan P. Williams, Creagh Cole
WSC
2001
13 years 8 months ago
A practical bottleneck detection method
This paper describes a novel method for detecting the bottleneck in a discrete event system by examining the average duration of a machine being active for all machines. The machi...
Christoph Roser, Masaru Nakano, Minoru Tanaka
DAGSTUHL
2004
13 years 8 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
ACL
2010
13 years 4 months ago
Complexity Assumptions in Ontology Verbalisation
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
Richard Power