Sciweavers

EOR
2008
96views more  EOR 2008»
13 years 11 months ago
Round robin scheduling - a survey
Abstract This paper presents a comprehensive survey on the literature considering round robin tournaments. The terminology used within the area has been modified over time and toda...
Rasmus V. Rasmussen, Michael A. Trick
ENTCS
2008
64views more  ENTCS 2008»
13 years 11 months ago
General Refinement, Part Two: Flexible Refinement
In the previous, companion, paper [13] to this paper we introduced our general model of refinement, discussed ideas around determinism and interfaces that the general definition r...
Steve Reeves, David Streader
ENTCS
2008
65views more  ENTCS 2008»
13 years 11 months ago
Rules and Strategies in Java
In this paper we present the essential feature we have considered when designing a new language based on rules and strategies. Relying on the implementation of Tom, we explain how...
Pierre-Etienne Moreau, Antoine Reilles
AMC
2006
72views more  AMC 2006»
13 years 11 months ago
The many forms of hypercomputation
This paper surveys a wide range of proposed hypermachines, examining the resources that they require and the capabilities that they possess.
Toby Ord
ENDM
2008
93views more  ENDM 2008»
13 years 11 months ago
On Universal Graphs of Minor Closed Families
For a family F of graphs, a graph U is said to be F-universal if every graph of F is a subgraph of U. Similarly, a graph is said to be F-induced-universal if every graph of F is a...
Arnaud Labourel
EL
2008
184views more  EL 2008»
13 years 11 months ago
Breedbot: an evolutionary robotics application in digital content
Research paper Purpose of this paper This paper describe an integrated hardware/software system based on Evolutionary Robotics and its application in Edutainment context. Design/me...
Orazio Miglino, Onofrio Gigliotta, Michela Pontico...
EJC
2008
13 years 11 months ago
On the number of combinations without certain separations
Abstract. In this paper we enumerate the number of ways of selecting k objects from n objects arrayed in a line such that no two selected ones are separated by m-1, 2m-1,
Toufik Mansour, Yidong Sun
AIL
2006
90views more  AIL 2006»
13 years 11 months ago
Deontic logics for prioritized imperatives
When a conflict of duties arises, a resolution is often sought by determining an ordering of priority or importance. This paper examines how such a conflict resolution works, compa...
Jörg Hansen
DM
2008
84views more  DM 2008»
13 years 11 months ago
Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor
In this paper, we prove that cyclic hamiltonian cycle systems of the complete graph minus a 1-factor, Kn - I, exist if and only if n 2, 4( mod 8) and n = 2p with p
Heather Jordon, Joy Morris
DM
2008
82views more  DM 2008»
13 years 11 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon