Sciweavers

2661 search results - page 213 / 533
» Quantum Complexity Classes
Sort
View
98
Voted
DAM
2006
88views more  DAM 2006»
15 years 3 months ago
NP-completeness results for edge modification problems
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
Pablo Burzyn, Flavia Bonomo, Guillermo Durá...
145
Voted
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 3 months ago
Automatic Structures: Richness and Limitations
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
Bakhadyr Khoussainov, André Nies, Sasha Rub...
131
Voted
SIGCSE
2008
ACM
169views Education» more  SIGCSE 2008»
15 years 3 months ago
APOGEE: automated project grading and instant feedback system for web based computing
Providing consistent, instant, and detailed feedback to students has been a big challenge in teaching Web based computing, given the complexity of project assignments and the comp...
Xiang Fu, Boris Peltsverger, Kai Qian, Lixin Tao, ...
121
Voted
SOCO
2008
Springer
15 years 3 months ago
Compositional Modeling for Data-Centric Business Applications
Data-centric business applications comprise an important class of distributed systems that includes on-line stores, document management systems, and patient portals. However, their...
Ethan K. Jackson, Wolfram Schulte
105
Voted
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 3 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin