Sciweavers

1968 search results - page 118 / 394
» The Complexity of Valued Constraint Models
Sort
View
CAISE
2004
Springer
15 years 5 months ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
ETS
2006
IEEE
114views Hardware» more  ETS 2006»
15 years 1 months ago
From Research Resources to Learning Objects: Process Model and Virtualization Experiences
Typically, most research and academic institutions own and archive a great amount of objects and research related resources that have been produced, used and maintained over long ...
José Luis Sierra, Alfredo Fernández-...
FOCS
2006
IEEE
15 years 7 months ago
Strategic Network Formation through Peering and Service Agreements
We introduce a game theoretic model of network formation in an effort to understand the complex system of business relationships between various Internet entities (e.g., Autonomou...
Elliot Anshelevich, F. Bruce Shepherd, Gordon T. W...
JUCS
2006
109views more  JUCS 2006»
15 years 1 months ago
Verifying Real-Time Properties of tccp Programs
: The size and complexity of software systems are continuously increasing, which makes them difficult and labor-intensive to develop, test and evolve. Since concurrent systems are ...
María Alpuente, María-del-Mar Gallar...
ICDM
2010
IEEE
160views Data Mining» more  ICDM 2010»
14 years 11 months ago
A Privacy Preserving Framework for Gaussian Mixture Models
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
Madhusudana Shashanka