Sciweavers

2223 search results - page 349 / 445
» Ontological Framework for Approximation
Sort
View
MOBIQUITOUS
2007
IEEE
15 years 10 months ago
Minimum Disruption Service Composition and Recovery over Mobile Ad Hoc Networks
— The dynamic nature of mobile ad hoc networks poses fundamental challenges to the design of service composition schemes that can minimize the effect of service disruptions. Alth...
Shanshan Jiang, Yuan Xue, Douglas C. Schmidt
ICDT
2005
ACM
128views Database» more  ICDT 2005»
15 years 10 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
FOCS
2003
IEEE
15 years 9 months ago
Proving Hard-Core Predicates Using List Decoding
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...
Adi Akavia, Shafi Goldwasser, Shmuel Safra
145
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
Optimal Partition of QoS Requirements for Many-to-Many Connections
— We study problems related to supporting multicast connections with Quality of Service (QoS) requirements. We investigate the problem of optimal resource allocation in the conte...
Dean H. Lorenz, Ariel Orda, Danny Raz
RTAS
2003
IEEE
15 years 9 months ago
Modular Code Generation from Hybrid Automata based on Data Dependency
Model-based automatic code generation is a process of converting abstract models into concrete implementations in the form of a program written in a high-level programming languag...
Jesung Kim, Insup Lee