11740 search results - page 175 / 2348 » More Problems in Rewriting |
163
click to vote
IWFM
2000
15 years 5 months ago
2000
ct Increasingly, model checking is being applied to more abstract problem domains than the traditional protocol analysis. The extent to which such an approach is able to provide us...
133
click to vote
AAAI
1990
15 years 5 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
138
Voted
COR
2010
15 years 4 months ago
2010
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
138
click to vote
APIN
2005
15 years 4 months ago
2005
A hybrid Neural-Genetic algorithm (NG) is presented for the frequency assignment problem in satellite communications (FAPSC). The goal of this problem is minimizing the cochannel i...
134
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...