Sciweavers

612 search results - page 80 / 123
» An Empirical Study of Agent Programs
Sort
View
IWPC
1999
IEEE
14 years 1 months ago
Understanding COBOL Systems using Inferred Types
In a typical COBOL program, the data division consists of 50% of the lines of code. Automatic type inference can help to understand the large collections of variable declarations ...
Arie van Deursen, Leon Moonen
JMLR
2012
11 years 11 months ago
Sample Complexity of Composite Likelihood
We present the first PAC bounds for learning parameters of Conditional Random Fields [12] with general structures over discrete and real-valued variables. Our bounds apply to com...
Joseph K. Bradley, Carlos Guestrin
CLEIEJ
2002
113views more  CLEIEJ 2002»
13 years 9 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 2 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
SCAM
2008
IEEE
14 years 3 months ago
Constructing Subtle Faults Using Higher Order Mutation Testing
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
Yue Jia, Mark Harman