Sciweavers

999 search results - page 88 / 200
» On the Decidability of Functional Uncertainty
Sort
View
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 4 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
PODS
2010
ACM
205views Database» more  PODS 2010»
14 years 3 months ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
ECOWS
2006
Springer
13 years 12 months ago
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach
We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete funct...
Jyotishman Pathak, Samik Basu, Robyn R. Lutz, Vasa...
APAL
2007
131views more  APAL 2007»
13 years 10 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
AAMAS
2011
Springer
13 years 5 months ago
Alternatives to truthfulness are hard to recognize
Abstract. The central question in mechanism design is how to implement a given social choice function. One of the most studied concepts is that of truthful implementations in which...
Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, ...