1871 search results - page 35 / 375 » The Ephemeral Pairing Problem |
104
click to vote
DAM
2006
14 years 11 months ago
2006
We investigate the relation between two aspects of round robin tournament scheduling problems: breaks and distances. The distance minimization problem and the breaks maximization ...
78
Voted
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
83
Voted
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
102
click to vote
CP
2006
Springer
15 years 1 months ago
2006
Springer
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
CSL
2007
Springer
14 years 11 months ago
2007
Springer
When users access information from text, they engage in strategic fixation, visually scanning the text to focus on regions of interest. However, because speech is both serial and ...