973 search results - page 58 / 195 » Arguing Using Opponent Models |
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
EDOC
2008
IEEE
14 years 2 months ago
2008
IEEE
Business processes used in networked business are often large and complex, which makes them difficult to manage and change. In this paper we address this lack of flexibility by pr...
ENTCS
2007
13 years 7 months ago
2007
In this paper we present our rst approach to model and verify biological systems using ntcc, a concurrent constraint process calculus. We argue that the partial information const...
SIGIR
2002
ACM
13 years 7 months ago
2002
ACM
Topic Detection and Tracking (TDT) tasks are evaluated using a cost function. The standard TDT cost function assumes a constant probability of relevance P(rel) across all topics. ...
EJWCN
2010
13 years 2 months ago
2010
Simulation studies have been the predominant method of evaluating ad hoc routing algorithms. Despite their wide use and merits, simulations are generally time consuming. Furthermo...