Sciweavers

1422 search results - page 49 / 285
» Test Generation Algorithms Based on Preorder Relations
Sort
View
WWW
2008
ACM
15 years 10 months ago
Composite process oriented service discovery in preserving business and timed relation
This paper proposes an approach for solving the problem of composite process oriented service discovery with preserving business and timed relation. Key to our approach is the def...
Yu Dai, Lei Yang, Bin Zhang, Kening Gao
ICPPW
2002
IEEE
15 years 2 months ago
A Statistical Approach for the Analysis of the Relation Between Low-Level Performance Information, the Code, and the Environment
This paper presents a methodology for aiding a scientific programmer to evaluate the performance of parallel programs on advanced architectures. It applies well-defined design o...
Nayda G. Santiago, Diane T. Rover, Domingo Rodr&ia...
IJCAI
2001
14 years 11 months ago
Balance and Filtering in Structured Satisfiable Problems
New methods to generate hard random problem instances have driven progress on algorithms for deduction and constraint satisfaction. Recently Achlioptas et al. (AAAI 2000) introduc...
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas...
CN
2004
107views more  CN 2004»
14 years 9 months ago
A multicriteria handoff decision scheme for the next generation tactical communications systems
In this paper a novel handoff decision algorithm for the mobile subsystem of tactical communications systems is introduced. In this algorithm, handoff decision metrics are: receiv...
Tolga Onel, Cem Ersoy, Erdal Cayirci, Gerard Parr
ICASSP
2011
IEEE
14 years 1 months ago
Intra-session variability compensation and a hypothesis generation and selection strategy for speaker segmentation
This paper addresses the problem of speaker segmentation in two-speaker telephone conversations, using an eigenvoice based factor analysis approach. We present a set of improvemen...
Carlos Vaquero, Alfonso Ortega, Eduardo Lleida