Sciweavers

9842 search results - page 353 / 1969
» Problem complexity
Sort
View
AIPS
2009
15 years 8 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 7 months ago
Fast-Group-Decodable STBCs via Codes over GF(4)
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...
Natarajan Lakshmi Prasad, B. Sundar Rajan
SPAA
2009
ACM
16 years 4 months ago
Brief announcement: low depth cache-oblivious sorting
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifics (cache...
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardha...
ROBIO
2006
IEEE
110views Robotics» more  ROBIO 2006»
16 years 26 days ago
Demand-Driven Development of Parallel Robots with Adaptronic Components by a Modular System
Abstract - Parallel robots provide high stiffness, accelerations and accuracy. They are relatively complex products that are specialized to a specific problem. Normally a new robot...
Carsten Stechert, Nenad Pavlovic, Hans-Joachim Fra...
HEURISTICS
2007
103views more  HEURISTICS 2007»
15 years 6 months ago
Distance measures based on the edit distance for permutation-type representations
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
Kenneth Sörensen