1366 search results - page 171 / 274 » Modularizing Contexted Constraints |
126
click to vote
MP
1998
15 years 2 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
131
click to vote
SP
2002
IEEE
15 years 2 months ago
2002
IEEE
Markov models have been used extensively in psychology of learning. Applications of hidden Markov models are rare however. This is partially due to the fact that comprehensive stat...
125
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
105
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
111
click to vote
SYNTHESE
2010
15 years 1 months ago
2010
I develop a strategy for representing epistemic states and epistemic changes that seeks to be sensitive to the difference between voluntary and involuntary aspects of our epistemi...