1055 search results - page 118 / 211 » Enumerations in computable structure theory |
137
click to vote
ALDT
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
129
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
122
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
141
click to vote
TLCA
2007
Springer
15 years 10 months ago
2007
Springer
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
136
click to vote
TPHOL
2002
IEEE
15 years 9 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...