Sciweavers

1538 search results - page 32 / 308
» Relative Randomness and Cardinality
Sort
View
AAI
2010
147views more  AAI 2010»
13 years 9 months ago
Maintaining engagement in Long-Term Interventions with Relational Agents
We discuss issues in designing virtual humans for applications which require long-term voluntary use, and the problem of maintaining engagement with users over time. Concepts and t...
Timothy W. Bickmore, Daniel Schulman, Langxuan Yin
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
13 years 9 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
SYNTHESE
2008
74views more  SYNTHESE 2008»
13 years 9 months ago
Could there be exactly two things?
Many philosophers think that, necessarily, any material objects have a fusion (let's call that doctrine "Universalism"). In this paper I point out a couple of strang...
Juan Comesaña
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 8 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
ECML
2006
Springer
14 years 1 months ago
TildeCRF: Conditional Random Fields for Logical Sequences
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
Bernd Gutmann, Kristian Kersting