Sciweavers

5624 search results - page 206 / 1125
» On Conditional Covering Problem
Sort
View
ALT
2005
Springer
16 years 3 months ago
Learning Multiple Languages in Groups
We consider a variant of Gold’s learning paradigm where a learner receives as input n different languages (in form of one text where all input languages are interleaved). Our g...
Sanjay Jain, Efim B. Kinber

Publication
222views
16 years 3 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
EUC
2005
Springer
16 years 3 days ago
RFIDcover - A Coverage Planning Tool for RFID Networks with Mobile Readers
Abstract. Radio Frequency Identification (RFID) finds use in numerous applications involving item identification and tracking. In a typical application, RFID tags are attached t...
S. Anusha, Sridhar Iyer
MFCS
2009
Springer
15 years 11 months ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
EXPCS
2007
15 years 10 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne