Sciweavers

2150 search results - page 84 / 430
» On a restricted cross-intersection problem
Sort
View
HYBRID
2003
Springer
15 years 9 months ago
Universality and Language Inclusion for Open and Closed Timed Automata
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
Joël Ouaknine, James Worrell
TIME
1994
IEEE
15 years 8 months ago
The Persistence of Statistical Information
The frame problem was originally de ned in the context of the situation calculus. The problem also manifests itself in more sophisticated temporal logics that can represent interv...
Scott D. Goodwin, Eric Neufeld, André Trude...
EOR
2006
61views more  EOR 2006»
15 years 4 months ago
Scheduling trainees at a hospital department using a branch-and-price approach
Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encou...
Jeroen Beliën, Erik Demeulemeester
IANDC
1998
64views more  IANDC 1998»
15 years 4 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
SIAMJO
2010
135views more  SIAMJO 2010»
15 years 2 months ago
On the Complexity of Selecting Disjunctions in Integer Programming
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
Ashutosh Mahajan, Ted K. Ralphs