Sciweavers

8413 search results - page 185 / 1683
» Ordering Problem Subgoals
Sort
View
ESCIENCE
2006
IEEE
14 years 2 months ago
Grid Enabled Problem Solving Environments for Text Categorization
As the large volume of resources involved and the power of computational Grids increased, there is a corresponding and urgent need for employ the grid technologies into problem so...
Jian Mei, Wu Zhang, Suge Wang
USENIX
2000
14 years 3 days ago
MOSIX: How Linux Clusters Solve Real-World Problems
As the complexity of software increases, the size of the software tends to increase as well, which incurs longer compilation and build cycles. In this paper, the authors present o...
Steve McClure, Richard Wheeler
AAAI
1996
14 years 2 days ago
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
Roberto J. Bayardo Jr., Daniel P. Miranker
COR
2006
88views more  COR 2006»
13 years 10 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
MOC
1998
126views more  MOC 1998»
13 years 10 months ago
Implicit-explicit multistep finite element methods for nonlinear parabolic problems
We approximate the solution of initial boundary value problems for nonlinear parabolic equations. In space we discretize by finite element methods. The discretization in time is b...
Georgios Akrivis, Michel Crouzeix, Charalambos Mak...