Sciweavers

57 search results - page 6 / 12
» Where Do Bugs Come from
Sort
View
ALT
2001
Springer
14 years 4 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
CAISE
2003
Springer
14 years 26 days ago
Designing a Federated Multimedia Information System on the Semantic Web
A federated Web-based multimedia information system on one hand gathers its data from various Web sources, on the other hand offers the end-user a rich semantics describing its co...
Richard Vdovjak, Peter Barna, Geert-Jan Houben
PLDI
2005
ACM
14 years 1 months ago
Checking type safety of foreign function calls
We present a multi-lingual type inference system for checking type safety across a foreign function interface. The goal of our system is to prevent foreign function calls from int...
Michael Furr, Jeffrey S. Foster
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 11 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
ATAL
2004
Springer
14 years 1 months ago
Fitting and Compilation of Multiagent Models through Piecewise Linear Functions
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
David V. Pynadath, Stacy Marsella