Sciweavers

86 search results - page 6 / 18
» Definability in Substructure Orderings, II: Finite Ordered S...
Sort
View
EJC
2010
13 years 7 months ago
Dualities in full homomorphisms
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Richard N. Ball, Jaroslav Nesetril, Ales Pultr
GECCO
2004
Springer
140views Optimization» more  GECCO 2004»
14 years 25 days ago
Keeping the Diversity with Small Populations Using Logic-Based Genetic Programming
We present a new method of Logic-Based Genetic Programming (LBGP). Using the intrinsic mechanism of backtracking in Prolog, we utilize large individual programs with redundant clau...
Ken Taniguchi, Takao Terano
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 7 months ago
Bulking II: Classifications of Cellular Automata
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinge...
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 7 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
APN
2006
Springer
13 years 11 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard