3204 search results - page 45 / 641 » Online Learning with Constraints |
111
click to vote
ICDCS
2000
IEEE
15 years 3 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
78
Voted
OR
2006
Springer
14 years 11 months ago
2006
Springer
The Dial-A-Ride Problem (DARP) has often been used to organize transport of elderly and handicapped people, assuming that these people can book their transport in advance. But the ...
FLAIRS
2006
15 years 14 days ago
2006
This work is a confluence of three problems in constraint reasoning: qualitative temporal reasoning (QTR), incremental reasoning, and explanation generation. Our primary objective...
NAACL
2010
14 years 9 months ago
2010
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
193
Voted
ICDE
2008
IEEE
16 years 13 days ago
2008
IEEE
Abstract- Data streams of real numbers are generated naturally in many applications. The technology of online subsequence searching in data streams becomes more and more important ...