Sciweavers

8109 search results - page 233 / 1622
» A Model of Component-Based Programming
Sort
View
163
Voted
COLING
2010
15 years 1 months ago
Fast, Greedy Model Minimization for Unsupervised Tagging
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
Sujith Ravi, Ashish Vaswani, Kevin Knight, David C...
ECOOP
2004
Springer
15 years 11 months ago
An AOP Implementation Framework for Extending Join Point Models
Mechanisms in AOP (aspect-oriented programming) can be characterized by a JPM (join point model). AOP is effective in unanticipated software evolution because crosscutting concer...
Naoyasu Ubayashi, Hidehiko Masuhara, Tetsuo Tamai
PADL
2004
Springer
15 years 11 months ago
Pruning in the Extended Andorra Model
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
Ricardo Lopes, Vítor Santos Costa, Fernando...
199
Voted
ASP
2001
Springer
15 years 11 months ago
Computing stable models in parallel
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...
PPDP
2000
Springer
15 years 10 months ago
A model for comparing the space usage of lazy evaluators
Identifying the source of space faults in functional programs is hard. The problem is compoundedas space usage can vary enormously from one implementation to another. We use a ter...
Adam Bakewell, Colin Runciman