13987 search results - page 765 / 2798 » The Two Guards Problem |
175
click to vote
IWOCA
2009
Springer
16 years 7 days ago
2009
Springer
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
186
click to vote
ICALP
2001
Springer
16 years 4 days ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
181
click to vote
HICSS
2000
IEEE
16 years 2 days ago
2000
IEEE
Multi-site scheduling deals with the scheduling problems of an enterprise with several distributed production sites, where sites are using the intermediate products of other sites...
189
click to vote
ACMDIS
2000
ACM
16 years 19 hour ago
2000
ACM
Many sources of empirical data can be used to evaluate an interface (e.g., time to learn, time to perform benchmark tasks, number of errors on benchmark tasks, answers on question...
185
click to vote
CP
2000
Springer
16 years 29 min ago
2000
Springer
Most of complete search algorithms over Constraint Satisfaction Problems (csp) are based on Standard Backtracking. Two main enhancements of this basic scheme have been proposed : r...