Sciweavers

93 search results - page 18 / 19
» Monotonicity testing over general poset domains
Sort
View
ATAL
2008
Springer
13 years 9 months ago
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adv...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
MSR
2010
ACM
13 years 9 months ago
Identifying security bug reports via text mining: An industrial case study
-- A bug-tracking system such as Bugzilla contains bug reports (BRs) collected from various sources such as development teams, testing teams, and end users. When bug reporters subm...
Michael Gegick, Pete Rotella, Tao Xie
CIKM
2008
Springer
13 years 9 months ago
Large-scale, parallel automatic patent annotation
When researching new product ideas or filing new patents, inventors need to retrieve all relevant pre-existing know-how and/or to exploit and enforce patents in their technologica...
Milan Agatonovic, Niraj Aswani, Kalina Bontcheva, ...
OPODIS
2003
13 years 8 months ago
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
Detecting whether a finite execution trace (or a computation) of a distributed program satisfies a given predicate, called predicate detection, is a fundamental problem in distr...
Alper Sen, Vijay K. Garg
ATAL
2010
Springer
13 years 8 months ago
Distributed coordination of mobile agent teams: the advantage of planning ahead
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
Laura Barbulescu, Zachary B. Rubinstein, Stephen F...