Sciweavers

16404 search results - page 917 / 3281
» A set coverage problem
Sort
View
WCRE
1996
IEEE
15 years 12 months ago
Identifying Enumeration Types Modeled with Symbolic Constants
An important challenge in software reengineering is to encapsulate collections of related data that, due to the absence of appropriate constructs for encapsulation in legacy progr...
John M. Gravley, Arun Lakhotia
DEXAW
1998
IEEE
98views Database» more  DEXAW 1998»
15 years 11 months ago
Supporting Read-Only Transactions in Wireless Broadcasting
Wireless communications support a new form of data delivery in which servers broadcast data to a number of clients that listen to the broadcast channel and retrieve data of intere...
Evaggelia Pitoura
CRYPTO
2007
Springer
93views Cryptology» more  CRYPTO 2007»
15 years 11 months ago
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
Danny Harnik, Yuval Ishai, Eyal Kushilevitz
CP
2006
Springer
15 years 11 months ago
Inner and Outer Approximations of Existentially Quantified Equality Constraints
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
Alexandre Goldsztejn, Luc Jaulin
AAAI
2007
15 years 10 months ago
Action-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the probl...
Natalia Hernandez-Gardiol, Leslie Pack Kaelbling