1743 search results - page 255 / 349 » Generalized Modal Satisfiability |
144
click to vote
AAAI
1998
15 years 6 months ago
1998
When search techniques are used to solve a practical problem, the solution produced is often brittle in the sense that small execution difficulties can have an arbitrarily large e...
121
click to vote
AAAI
1997
15 years 6 months ago
1997
We show that a resealed constrainedness parameter provides the basis for accurate numerical models of search cost for both backtracking and local search algorithms. In the past, t...
111
click to vote
IPCO
1996
15 years 6 months ago
1996
We analyse a continued fraction algorithm (abbreviated CFA) for arbitrary dimension n showing that it produces simultaneous diophantine approximations which are up to the factor 2(...
154
click to vote
UAI
2007
15 years 5 months ago
2007
A research organization responds to a variety of customer requests. Each high level request is broken down into a set of low level requests. For each low level request, the resear...
112
Voted
WCE
2007
15 years 5 months ago
2007
—The problem of active shielding of some domains from the effect of the sources distributed in other domains is considered. The problem can be formulated either in a bounded dom...