Sciweavers

840 search results - page 9 / 168
» The Complexity of the Extended GCD Problem
Sort
View
RR
2007
Springer
14 years 1 months ago
Extending SWRL to Enhance Mathematical Support
This paper presents an extension to the Semantic Web Rule Language and a methodology to enable advanced mathematical support in SWRL rules. This solution separates mathematical and...
Alfonso Sánchez-Macián, Encarna Past...
IPPS
1998
IEEE
13 years 12 months ago
NoWait-RPC: Extending ONC RPC to a Fully Compatible Message Passing System
Locally and functionally distributed applications realized on different system architectures demand a universal, portable and intuitive software utility for interprocess communica...
Thomas Hopfner, Franz Fischer, Georg Färber
CHI
2001
ACM
14 years 8 months ago
Digital family portraits: supporting peace of mind for extended family members
A growing social problem in the U.S., and elsewhere, is supporting older adults who want to continue living independently, as opposed to moving to an institutional care setting. O...
Elizabeth D. Mynatt, Jim Rowan, Sarah Craighill, A...
AAAI
2006
13 years 9 months ago
Planning with First-Order Temporally Extended Goals using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. The problem of planning with TEGs is of renewed interest becau...
Jorge A. Baier, Sheila A. McIlraith
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
13 years 11 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira