Sciweavers

3663 search results - page 128 / 733
» Problems in the ontology of computer programs
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Coarse-grain Parallel Execution for 2-dimensional PDE Problems
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
Georgios I. Goumas, Nikolaos Drosinos, Vasileios K...
NETCOOP
2007
Springer
15 years 4 months ago
Minimum Transmission Energy Trajectories for a Linear Pursuit Problem
In this paper we study a pursuit problem in the context of a wireless sensor network, where the pursuer (i.e., mobile sink) trying to capture a pursuee (i.e., tracked object), movi...
Attila Vidács, Jorma T. Virtamo
ENDM
2006
69views more  ENDM 2006»
14 years 10 months ago
Timetabling problems at the TU Eindhoven
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
John van den Broek, Cor A. J. Hurkens, Gerhard J. ...
COR
2007
97views more  COR 2007»
14 years 10 months ago
Two-stage general block patterns for the two-dimensional cutting problem
This paper presents an algorithm for the unconstrained two-dimensional cutting problem of rectangular pieces. It proposes the two-stage general block pattern that can be cut into ...
Yaodong Cui, Xianquan Zhang
DISOPT
2007
93views more  DISOPT 2007»
14 years 10 months ago
A feasibility pump heuristic for general mixed-integer problems
Finding a feasible solution of a given Mixed-Integer Programming (MIP) model is a very important (NP-complete) problem that can be extremely hard in practice. Very recently, Fisch...
Livio Bertacco, Matteo Fischetti, Andrea Lodi