2423 search results - page 248 / 485 » AnswerArt - Contextualized Question Answering |
165
Voted
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
188
click to vote
ISOOMS
1994
15 years 10 months ago
1994
Although object-oriented programming techniques have evolved into an accepted technology with recognized benefits for software development, profound investigations of qualitative a...
159
click to vote
SIGSOFT
1994
ACM
15 years 10 months ago
1994
ACM
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
157
click to vote
STACS
1989
Springer
15 years 10 months ago
1989
Springer
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
152
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract-- The primary contribution of this paper is in a wireless sensor network's coverage analysis method, which focuses on both the coverage itself and its uniformity and ...