Sciweavers

6036 search results - page 81 / 1208
» Web search solved
Sort
View
125
Voted
RTA
1997
Springer
15 years 4 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
97
Voted
EOR
2002
84views more  EOR 2002»
15 years 15 days ago
Solving container loading problems by block arrangement
In order to solve heterogeneous single and multiple container loading problems, an algorithm is presented that builds homogeneous blocks of identically orientated items. First a g...
Michael Eley
83
Voted
SARA
2005
Springer
15 years 6 months ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler
IEAAIE
2001
Springer
15 years 5 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
95
Voted
TPDS
2008
88views more  TPDS 2008»
15 years 18 days ago
A Two-Hop Solution to Solving Topology Mismatch
The efficiency of Peer-to-Peer (P2P) systems is largely dependent on the overlay constructions. Due to the random selection of logical neighbors, there often exists serious topolog...
Yunhao Liu