Sciweavers

8780 search results - page 259 / 1756
» On the Feasibility of Consistent Computations
Sort
View
COR
2006
94views more  COR 2006»
15 years 7 months ago
Computing obnoxious 1-corner polygonal chains
We consider an obnoxious facility location problem in which the facility is a trajectory consisting of a bounded length polygonal chain of two edges having extremes anchored at tw...
José Miguel Díaz-Báñez...
ACTA
2005
87views more  ACTA 2005»
15 years 7 months ago
Hybrid networks of evolutionary processors are computationally complete
A hybrid network of evolutionary processors (an HNEP) consists of several language processors which are located in the nodes of a virtual graph and able to perform only one type o...
Erzsébet Csuhaj-Varjú, Carlos Mart&i...
TOG
2008
163views more  TOG 2008»
15 years 7 months ago
Imperfect shadow maps for efficient computation of indirect illumination
We present a method for interactive computation of indirect illumination in large and fully dynamic scenes based on approximate visibility queries. While the high-frequency nature...
Tobias Ritschel, Thorsten Grosch, Min H. Kim, Hans...
ASC
2004
15 years 7 months ago
Soft computing applications in dynamic model identification of polymer extrusion process
This paper proposes the applications of soft computing to deal with the constraints in conventional modelling techniques of the dynamic extrusion process. The proposed technique i...
Leong Ping Tan, Ahmad Lotfi, Eugene Lai, J. B. Hul...
ISCI
1998
82views more  ISCI 1998»
15 years 7 months ago
The ParaStation Project: Using Workstations as Building Blocks for Parallel Computing
The ParaStation communication fabric provides a high-speed communicationnetwork with user-levelaccess to enable e cientparallel computing on workstation clusters. The architecture...
Thomas M. Warschko, Joachim M. Blum, Walter F. Tic...