Sciweavers

941 search results - page 9 / 189
» The Parking Permit Problem
Sort
View
AMC
2011
14 years 4 months ago
Variational theory and domain decomposition for nonlocal problems
In this article we present the first results on domain decomposition methods for nonlocal operators. We present a nonlocal variational formulation for these operators and establi...
Burak Aksoylu, Michael L. Parks
AMEC
2004
Springer
15 years 2 months ago
An Options-Based Method to Solve the Composability Problem in Sequential Auctions
Abstract. Current auctions often expose bidding agents to two difficult, yet common, problems. First, bidding agents often have the opportunity to participate in successive auctio...
Adam I. Juda, David C. Parkes
IJCAI
1993
14 years 10 months ago
Using Inferred Disjunctive Constraints To Decompose Constraint Satisfaction Problems
Constraint satisfaction problems involve finding values for problem variables that satisfy constraints on what combinations of values are permitted. They have applications in many...
Eugene C. Freuder, Paul D. Hubbe
114
Voted
PEPM
1995
ACM
15 years 1 months ago
Shape Analysis as a Generalized Path Problem
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...
Thomas W. Reps
DATE
2000
IEEE
92views Hardware» more  DATE 2000»
15 years 1 months ago
An Efficient Heuristic Approach to Solve the Unate Covering Problem
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
Roberto Cordone, Fabrizio Ferrandi, Donatella Sciu...