Sciweavers

1028 search results - page 101 / 206
» Measuring Distributional Similarity in Context
Sort
View
CP
2006
Springer
14 years 17 days ago
Failure Analysis in Backtrack Search for Constraint Satisfaction
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Tudor Hulubei, Barry O'Sullivan
ENTCS
2007
85views more  ENTCS 2007»
13 years 8 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
Sayan Mitra, Nancy A. Lynch
BMCBI
2010
91views more  BMCBI 2010»
13 years 9 months ago
Algorithm-driven Artifacts in median polish summarization of Microarray data
Background: High-throughput measurement of transcript intensities using Affymetrix type oligonucleotide microarrays has produced a massive quantity of data during the last decade....
Federico M. Giorgi, Anthony M. Bolger, Marc Lohse,...
ISPAN
2002
IEEE
14 years 1 months ago
On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
CAISE
2001
Springer
14 years 1 months ago
Objects Control for Software Configuration Management
A major requirement in Software Engineering is to reduce the time to market. This requirement along with a demand for product sophistication and better quality has led to larger te...
Jacky Estublier