Sciweavers

3946 search results - page 665 / 790
» The computational complexity of choice sets
Sort
View
WETICE
2003
IEEE
15 years 11 months ago
Design and Implementation of Virtual Private Services
Large scale distributed applications such as electronic commerce and online marketplaces combine network access with multiple storage and computational elements. The distributed r...
Sotiris Ioannidis, Steven M. Bellovin, John Ioanni...
AGTIVE
2003
Springer
15 years 11 months ago
Local Specification of Surface Subdivision Algorithms
Many polygon mesh algorithms operate in a local manner, yet are formally specified using global indexing schemes. This obscures the essence of these algorithms and makes their spe...
Colin Smith, Przemyslaw Prusinkiewicz, Faramarz F....
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 11 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
ECML
2003
Springer
15 years 11 months ago
Robust k-DNF Learning via Inductive Belief Merging
A central issue in logical concept induction is the prospect of inconsistency. This problem may arise due to noise in the training data, or because the target concept does not fit...
Frédéric Koriche, Joël Quinquet...
ISMIS
2003
Springer
15 years 11 months ago
Enacting an Agent-Based Digital Self in a 24x7 Web Services World
As broadband access to the Internet becomes pervasive, the need for a 24 hours a day, seven days a week (24x7) interface within the client devices, requires a level of sophisticati...
Steve Goschnick