Sciweavers

3653 search results - page 158 / 731
» Learning of Partial Languages
Sort
View
118
Voted
AIPS
2006
15 years 5 months ago
Bounded Branching and Modalities in Non-Deterministic Planning
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
Blai Bonet
122
Voted
ML
2007
ACM
134views Machine Learning» more  ML 2007»
15 years 3 months ago
Status report: the manticore project
The Manticore project is an effort to design and implement a new functional language for parallel programming. Unlike many earlier parallel languages, Manticore is a heterogeneous...
Matthew Fluet, Nic Ford, Mike Rainey, John H. Repp...
113
Voted
SSPR
2004
Springer
15 years 9 months ago
Learning from General Label Constraints
Most machine learning algorithms are designed either for supervised or for unsupervised learning, notably classification and clustering. Practical problems in bioinformatics and i...
Tijl De Bie, Johan A. K. Suykens, Bart De Moor
136
Voted
ACL
2010
15 years 1 months ago
Using Smaller Constituents Rather Than Sentences in Active Learning for Japanese Dependency Parsing
We investigate active learning methods for Japanese dependency parsing. We propose active learning methods of using partial dependency relations in a given sentence for parsing an...
Manabu Sassano, Sadao Kurohashi
POPL
2002
ACM
16 years 3 months ago
Towards automatic construction of staged compilers
Some compilation systems, such as offline partial evaluators and selective dynamic compilation systems, support staged optimizations. A staged optimization is one where a logicall...
Matthai Philipose, Craig Chambers, Susan J. Eggers