16596 search results - page 179 / 3320 » Generalized Assignment Problems |
105
click to vote
AAAI
2006
15 years 3 months ago
2006
We consider the iterated belief change that occurs following an alternating sequence of actions and observations. At each instant, an agent has some beliefs about the action that ...
130
click to vote
FCS
2006
15 years 3 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
128
click to vote
NIPS
2004
15 years 3 months ago
2004
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...
122
click to vote
NIPS
2001
15 years 3 months ago
2001
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
149
click to vote
ISMB
1996
15 years 3 months ago
1996
This study demonstratesthe use of decision tree classifiers as the basis for a general gene-finding system. The system uses a dynamic programmingalgorithm that. finds the optimal ...