10493 search results - page 1374 / 2099 » Dynamic Word Problems |
184
click to vote
ICRE
1996
IEEE
15 years 11 months ago
1996
IEEE
This paper discusses a technique to structure utterance records of the meetings for requirements elicitation based on speech act theory. To elicit requirements to the system to be...
169
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
Abstract. Most phylogenetics literature and construction methods based upon characters presume monomorphism (one state per character per species), yet polymorphism (multiple states...
180
click to vote
ISCA
1993
IEEE
15 years 11 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...
177
click to vote
COLT
1994
Springer
15 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...
179
click to vote
COMPGEOM
1994
ACM
15 years 11 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...