Sciweavers

4940 search results - page 530 / 988
» On the Complexity of Universal Programs
Sort
View
KBSE
2008
IEEE
16 years 1 months ago
A Case for Automatic Exception Handling
Exception handling mechanisms have been around for more than 30 years. Nevertheless, modern exceptions systems are not very different from the early models. Programming languages ...
Bruno Cabral, Paulo Marques
SEMCO
2007
IEEE
16 years 1 months ago
Modeling Discriminative Global Inference
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
Nicholas Rizzolo, Dan Roth
EUROSYS
2010
ACM
16 years 1 months ago
XCPU3: Workload Distribution and Aggregation
The mainstream adoption of cluster, grid, and most recently cloud computing models have broadened the applicability of parallel programming from scientific communities to the bus...
Pravin Shinde, Eric Van Hensbergen
SARA
2007
Springer
16 years 29 days ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...
WG
2007
Springer
16 years 29 days ago
On Finding Graph Clusterings with Maximum Modularity
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...