Sciweavers

1523 search results - page 209 / 305
» Partially ordered secretaries
Sort
View
177
Voted
CP
2009
Springer
16 years 1 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
77
Voted
CHI
2009
ACM
16 years 1 months ago
Designing trustworthy situated services: an implicit and explicit assessment of locative images-effect on trust
This paper examines a visual design element unique to situated, hot-spot style, services: locativeness. This is the extent to which the media representing a service relates to its...
Vassilis Kostakos, Ian Oakley
KDD
2006
ACM
228views Data Mining» more  KDD 2006»
16 years 1 months ago
Algorithms for time series knowledge mining
Temporal patterns composed of symbolic intervals are commonly formulated with Allen's interval relations originating in temporal reasoning. This representation has severe dis...
Fabian Mörchen
78
Voted
RECOMB
2001
Springer
16 years 1 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
90
Voted
CADE
2002
Springer
16 years 1 months ago
Basic Syntactic Mutation
Modularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46 Michael Abbott, Neil Ghani, and Christoph L?uth Union of Equational Theo...
Christopher Lynch, Barbara Morawska