Sciweavers

3663 search results - page 131 / 733
» Problems in the ontology of computer programs
Sort
View
132
Voted
IFIP
2009
Springer
15 years 11 months ago
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-do...
Gilles Bertrand, Samer Lahoud, Géraldine Te...
DSS
2006
95views more  DSS 2006»
15 years 4 months ago
On the computability of agent-based workflows
Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines...
Wai Yin Mok, Prashant Palvia, David Paper
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 4 months ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
CP
2004
Springer
15 years 10 months ago
Computing the Frequency of Partial Orders
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
Marc R. C. van Dongen

Book
270views
17 years 15 days ago
A Field Guide To Genetic Programming
"GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas...
Riccardo Poli, William B. Langdon, Nicholas Freit...