Sciweavers

257 search results - page 48 / 52
» A (Somewhat) New Solution to the Variable Binding Problem
Sort
View
SODA
2008
ACM
185views Algorithms» more  SODA 2008»
13 years 8 months ago
Better bounds for online load balancing on unrelated machines
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
AAAI
2000
13 years 8 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
GPCE
2004
Springer
14 years 15 days ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen
IJRR
2006
126views more  IJRR 2006»
13 years 7 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
JUCS
2010
160views more  JUCS 2010»
13 years 5 months ago
LCP-Nets: A Linguistic Approach for Non-functional Preferences in a Semantic SOA Environment
Abstract: This paper addresses the problem of expressing preferences among nonfunctional properties of services in a Web service architecture. In such a context, semantic and non-f...
Pierre Châtel, Isis Truck, Jacques Malenfant