Sciweavers

2354 search results - page 272 / 471
» A Common-Sense Theory of Time
Sort
View
EMSOFT
2004
Springer
15 years 12 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
15 years 12 months ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 10 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
GECCO
2008
Springer
196views Optimization» more  GECCO 2008»
15 years 7 months ago
ADANN: automatic design of artificial neural networks
In this work an improvement of an initial approach to design Artificial Neural Networks to forecast Time Series is tackled, and the automatic process to design Artificial Neural N...
Juan Peralta, Germán Gutiérrez, Arac...
202
Voted
EOR
2007
101views more  EOR 2007»
15 years 6 months ago
Searching for multiobjective preventive maintenance schedules: Combining preferences with evolutionary algorithms
Heavy industry maintenance facilities at aircraft service centers or railroad yards must contend with scheduling preventive maintenance tasks to ensure critical equipment remains ...
Gang Quan, Garrison W. Greenwood, Donglin Liu, Xia...