Sciweavers

2031 search results - page 116 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SFP
2003
15 years 7 months ago
Is it time for real-time functional programming?
Abstract This paper explores the suitability of functional languages for programming real-time systems. We study the requirements of real-time systems in general, outline typical l...
Kevin Hammond
285
Voted
AIIDE
2009
15 years 7 months ago
Case-Based Reasoning for Build Order in Real-Time Strategy Games
We present a case-based reasoning technique for selecting build orders in a real-time strategy game. The case retrieval process generalizes features of the game state and selects ...
Ben George Weber, Michael Mateas
ICML
2010
IEEE
15 years 7 months ago
Interactive Submodular Set Cover
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
Andrew Guillory, Jeff Bilmes
149
Voted
COMBINATORICA
2008
97views more  COMBINATORICA 2008»
15 years 6 months ago
Pfaffian labelings and signs of edge colorings
Abstract. We relate signs of edge-colorings (as in classical Penrose's result) with "Pfaffian labelings", a generalization of Pfaffian orientations, whereby edges ar...
Serguei Norine, Robin Thomas
MOR
2006
92views more  MOR 2006»
15 years 6 months ago
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
Lisa Fleischer, Adam N. Letchford, Andrea Lodi