Sciweavers

2080 search results - page 150 / 416
» Measuring empirical computational complexity
Sort
View
AAAI
2007
15 years 6 months ago
Anytime Coordination Using Separable Bilinear Programs
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
Marek Petrik, Shlomo Zilberstein
JNCA
2007
179views more  JNCA 2007»
15 years 4 months ago
Modeling intrusion detection system using hybrid intelligent systems
The process of monitoring the events occurring in a computer system or network and analyzing them for sign of intrusions is known as intrusion detection system (IDS). This paper p...
Sandhya Peddabachigari, Ajith Abraham, Crina Grosa...
ACL
2009
15 years 2 months ago
Non-Projective Dependency Parsing in Expected Linear Time
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...
Joakim Nivre
ACL
2011
14 years 8 months ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
IAJIT
2011
14 years 11 months ago
GUI structural metrics
: User interfaces have special characteristics that differentiate them from the rest of the software code. Typical software metrics that indicate its complexity and quality may not...
Izzat Alsmadi, Mohammed Al-Kabi