Result 1 to 20 of 1207 total
Intensional dynamic programming. A rosetta stone for structured dynamic programming. (English)
J. Algorithms 64, No. 4, 169-191 (2009).
1
Neuroevolution strategies for episodic reinforcement learning. (English)
J. Algorithms 64, No. 4, 152-168 (2009).
2
Learning of shared attention in sociable robotics. (English)
J. Algorithms 64, No. 4, 139-151 (2009).
3
Effective learning in the presence of adaptive counterparts. (English)
J. Algorithms 64, No. 4, 127-138 (2009).
4
Past-future separation and normal forms in temporal predicate logic specifications. (English)
J. Algorithms 64, No. 2-3, 106-124 (2009).
5
A formal framework for quantifying voter-controlled privacy. (English)
J. Algorithms 64, No. 2-3, 89-105 (2009).
6
Bichromatic separability with two boxes: A general approach. (English)
J. Algorithms 64, No. 2-3, 79-88 (2009).
7
An improved approximation algorithm for the ATSP with parameterized triangle inequality. (English)
J. Algorithms 64, No. 2-3, 74-78 (2009).
8
Solving necklace constraint problems. (English)
J. Algorithms 64, No. 2-3, 61-73 (2009).
9
A statistical approach to crosslingual natural language tasks. (English)
J. Algorithms 64, No. 1, 51-60 (2009).
10
P-stable models of strong kernel programs. (English)
J. Algorithms 64, No. 1, 41-50 (2009).
11
CTL AgentSpeak(L): A specification language for agent programs. (English)
J. Algorithms 64, No. 1, 31-40 (2009).
12
Generating complex ontology instances from documents. (English)
J. Algorithms 64, No. 1, 16-30 (2009).
13
Modeling preferences and conditional preferences on resource consumption and production in ASP. (English)
J. Algorithms 64, No. 1, 3-15 (2009).
14
Objective Bayesian probabilistic logic. (English)
J. Algorithms 63, No. 4, 167-183 (2008).
15
Solving satisfiability in the tile assembly model with a constant-size tileset. (English)
J. Algorithms 63, No. 4, 151-166 (2008).
16
A test suite for the evaluation of mixed multi-unit combinatorial auctions. (English)
J. Algorithms 63, No. 1-3, 130-150 (2008).
17
Experimental studies of variable selection strategies based on constraint weights. (English)
J. Algorithms 63, No. 1-3, 114-129 (2008).
18
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. (English)
J. Algorithms 63, No. 1-3, 90-113 (2008).
19
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. (English)
J. Algorithms 63, No. 1-3, 70-89 (2008).
20
Result 1 to 20 of 1207 total
Start
Contact
Print
General Help
