Sciweavers

1150 search results - page 144 / 230
» Advanced MPI Programming
Sort
View
AMC
2008
106views more  AMC 2008»
14 years 10 months ago
A non-binary constraint ordering heuristic for constraint satisfaction problems
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
Miguel A. Salido
COR
2008
88views more  COR 2008»
14 years 10 months ago
Solving the swath segment selection problem through Lagrangean relaxation
The Swath Segment Selection Problem (SSSP) is an NP-hard combinatorial optimization problem arising in the context of planning and scheduling satellite operations. It was defined ...
Roberto Cordone, Federico Gandellini, Giovanni Rig...
JDI
2006
45views more  JDI 2006»
14 years 10 months ago
The Next Killer Ap
: The next `killer ap' is a term the software development community uses to describe its great quest for advancing technology by defining and meeting users' needs and wan...
SIGCSE
2008
ACM
96views Education» more  SIGCSE 2008»
14 years 10 months ago
The mystery of "b : = (b = false)"
This paper describes some unusual patterns that emerged from a statistical analysis of the 1988 Advanced Placement Exam in Computer Science. Most multiple-choice questions on the ...
Stuart Reges
TASE
2008
IEEE
14 years 10 months ago
Perspectives in Probabilistic Verification
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
Joost-Pieter Katoen