Sciweavers

7092 search results - page 471 / 1419
» Parallelizing constraint programs
Sort
View
176
Voted
PC
2000
115views Management» more  PC 2000»
15 years 3 months ago
Rate of change load balancing in distributed and parallel systems
Dynamic Load Balancing is an important system function destined to distribute workload among available processors to improve throughput and/or execution times of parallel computer...
Luis Miguel Campos, Isaac D. Scherson
JCO
1998
80views more  JCO 1998»
15 years 3 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...
FECS
2006
100views Education» more  FECS 2006»
15 years 5 months ago
Pair Programming: Not for Everyone?
- Developments in CS1 pedagogy seek to improve the capabilities of students in their understanding of how to write programs. This involves learning how to solve various types of pr...
Jacob P. Somervell
VL
1994
IEEE
154views Visual Languages» more  VL 1994»
15 years 8 months ago
Stretch-A-Sketch: a Dynamic Diagrammer
Stretch-A-Sketch is a pen-based drawing program that combines recognition of hand-drawn glyphs with constraint based maintenance of spatial relations. The recognition program iden...
Mark D. Gross
110
Voted
COR
2006
108views more  COR 2006»
15 years 4 months ago
Variable neighborhood search and local branching
In this paper we develop a variable neighborhood search (VNS) heuristic for solving mixed-integer programs (MIPs). It uses CPLEX, the general-purpose MIP solver, as a black-box. N...
Pierre Hansen, Nenad Mladenovic, Dragan Urosevic