Sciweavers

2657 search results - page 342 / 532
» On the complexity of hierarchical problem solving
Sort
View
CCA
2000
Springer
15 years 11 months ago
The Uniformity Conjecture
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
Daniel Richardson
193
Voted
CP
1999
Springer
15 years 11 months ago
Search Procedures and Parallelism in Constraint Programming
Abstract. In this paper, we present a major improvement in the search procedures in constraint programming. First, we integrate various search procedures from AI and OR. Second, we...
Laurent Perron
SIGCSE
1998
ACM
131views Education» more  SIGCSE 1998»
15 years 11 months ago
Animation, visualization, and interaction in CS 1 assignments
Programs that use animations or visualizations attract student interest and offer feedback that can enhance different learning styles as students work to master programming and pr...
Owen L. Astrachan, Susan H. Rodger
ICALP
1998
Springer
15 years 11 months ago
Bridges for Concatenation Hierarchies
In the seventies, several classification schemes for the rational languages were proposed, based on the alternate use of certain operators (union, complementation, product and star...
Jean-Eric Pin
IPPS
1997
IEEE
15 years 11 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...