11345 search results - page 2228 / 2269 » Foundations of Computer Science |
83
Voted
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
134
click to vote
VL
2002
IEEE
15 years 4 months ago
2002
IEEE
Java program debugging was investigated in computer science students who used a software debugging environment (SDE) that provided concurrently displayed, adjacent, multiple and l...
120
click to vote
SIGECOM
2010
ACM
15 years 4 months ago
2010
ACM
The existing literature on optimal auctions focuses on optimizing the expected revenue of the seller, and is appropriate for risk-neutral sellers. In this paper, we identify good ...
97
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
107
Voted
COMPSAC
2009
IEEE
15 years 3 months ago
2009
IEEE
Matrices are essential in many fields of computer science, especially when large amounts of data must be handled efficiently. Despite this demand for matrix software, we were una...