21324 search results - page 296 / 4265 » Making the case for computing |
149
click to vote
CSEE
1999
Springer
15 years 8 months ago
1999
Springer
Real-world case studies are important to complement the academic skills and knowledge acquired by computer science students. In this paper we relate our experiences with a course ...
138
click to vote
FLAIRS
2007
15 years 6 months ago
2007
Currently, among the fastest approaches to AI task planning we find many forward-chaining heuristic planners, as FF. Most of their good performance comes from the use of domain-i...
144
click to vote
IJCAI
1993
15 years 5 months ago
1993
In this paper we present an average-case analysis of the nearest neighbor algorithm, a simple induction method that has been studied by manyresearchers. Our analysis assumes a con...
194
click to vote
HPDC
1999
IEEE
15 years 8 months ago
1999
IEEE
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
128
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...