Sciweavers

2131 search results - page 103 / 427
» Immunity for Closed Sets
Sort
View
LICS
2007
IEEE
16 years 17 days ago
Higher-Order Matching, Games and Automata
Higher-order matching is the problem given t = u where t, u are terms of simply typed λ-calculus and u is closed, is there a substitution θ such that tθ and u have the same nor...
Colin Stirling
TARK
2007
Springer
16 years 12 days ago
Robust equilibria under non-common priors
This paper considers the robustness of equilibria to a small amount of incomplete information, where players are allowed to have heterogenous priors. An equilibrium of a complete ...
Daisuke Oyama, Olivier Tercieux
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
15 years 11 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 11 months ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
GECCO
2003
Springer
15 years 11 months ago
Two Broad Classes of Functions for Which a No Free Lunch Result Does Not Hold
We identify classes of functions for which a No Free Lunch result does and does not hold, with particular emphasis on the relationship between No Free Lunch and problem description...
Matthew J. Streeter