Sciweavers

4934 search results - page 878 / 987
» complexity 2008
Sort
View
FUIN
2008
99views more  FUIN 2008»
15 years 4 months ago
Universality Analysis for One-Clock Timed Automata
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
Parosh Aziz Abdulla, Johann Deneux, Joël Ouak...
GPEM
2008
128views more  GPEM 2008»
15 years 4 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
BSL
2006
114views more  BSL 2006»
15 years 4 months ago
Schemata: The Concept of Schema in the History of Logic
Schemata have played important roles in logic since Aristotle's Prior Analytics. The syllogistic figures and moods can be taken to be argument schemata as can the rules of the...
John Corcoran
CGF
2006
191views more  CGF 2006»
15 years 4 months ago
A Robust Two-Step Procedure for Quad-Dominant Remeshing
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
Martin Marinov, Leif Kobbelt
CJ
2006
84views more  CJ 2006»
15 years 4 months ago
Instruction Level Parallelism through Microthreading - A Scalable Approach to Chip Multiprocessors
Most microprocessor chips today use an out-of-order instruction execution mechanism. This mechanism allows superscalar processors to extract reasonably high levels of instruction ...
Kostas Bousias, Nabil Hasasneh, Chris R. Jesshope