Sciweavers

7796 search results - page 1517 / 1560
» On Generalized Schur Numbers
Sort
View
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
GIS
1998
ACM
14 years 9 months ago
Mean-Variance Analysis of the Performance of Spatial Ordering Methods
Geographical Information Systems (GIS) involve the manipulation of large spatial data sets, and the performance of these systems is often determined by how these data sets are orga...
Akhil Kumar, Waleed A. Muhanna, Raymond A. Patters...
JAIR
2002
95views more  JAIR 2002»
14 years 9 months ago
A Critical Assessment of Benchmark Comparison in Planning
Recent trends in planning research have led to empirical comparison becoming commonplace. The eld has started to settle into a methodology for such comparisons, which for obvious ...
Adele E. Howe, Eric Dahlman
IJON
1998
140views more  IJON 1998»
14 years 9 months ago
Comment on "Discrete-time recurrent neural network architectures: A unifying review"
Paper [1] aimed at providing a unified presentation of neural network architectures. We show in the present comment (i) that the canonical form of recurrent neural networks presen...
Léon Personnaz, Gérard Dreyfus
INFORMS
1998
150views more  INFORMS 1998»
14 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
« Prev « First page 1517 / 1560 Last » Next »