Sciweavers

10997 search results - page 1901 / 2200
» On the Structure of Complete Sets
Sort
View
156
Voted
CAISE
2008
Springer
15 years 8 months ago
On the Definition of Service Granularity and Its Architectural Impact
Service granularity generally refers to the size of a service. The fact that services should be large-sized or coarse-grained is often postulated as a fundamental design principle ...
Raf Haesen, Monique Snoeck, Wilfried Lemahieu, Ste...
CIA
2008
Springer
15 years 8 months ago
Towards an Open Negotiation Architecture for Heterogeneous Agents
This paper presents the design of an open architecture for heterogeneous negotiating agents. Both the system level architecture as well as the architecture for negotiating agents a...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...
ASPDAC
2005
ACM
107views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Constraint extraction for pseudo-functional scan-based delay testing
Recent research results have shown that the traditional structural testing for delay and crosstalk faults may result in over-testing due to the non-trivial number of such faults t...
Yung-Chieh Lin, Feng Lu, Kai Yang, Kwang-Ting Chen...
HIPEAC
2010
Springer
15 years 8 months ago
Computer Generation of Efficient Software Viterbi Decoders
This paper presents a program generator for fast software Viterbi decoders for arbitrary convolutional codes. The input to the generator is a specification of the code and a single...
Frédéric de Mesmay, Srinivas Chellap...
COMPGEOM
2006
ACM
15 years 8 months ago
On the ICP algorithm
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
Esther Ezra, Micha Sharir, Alon Efrat
« Prev « First page 1901 / 2200 Last » Next »