Sciweavers

846 search results - page 125 / 170
» On the Computational Complexity of Spatio-Temporal Logics
Sort
View
MST
2010
140views more  MST 2010»
14 years 9 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
78
Voted
ER
2007
Springer
108views Database» more  ER 2007»
15 years 5 months ago
Reasoning over Extended ER Models
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
IFSA
2007
Springer
138views Fuzzy Logic» more  IFSA 2007»
15 years 5 months ago
Optimization to Manage Supply Chain Disruptions Using the NSGA-II
Disruption on a supply chain provokes lost that should be minimized looking for alternative suppliers. This solution involves a strategy to manage the impact of the disruption and ...
Víctor Serrano, Matías Alvarado, Car...
UML
2001
Springer
15 years 3 months ago
UML Modelling and Performance Analysis of Mobile Software Architectures
Modern distributed software applications generally operate in complex and heterogeneous computing environments (like the World Wide Web). Different paradigms (client-server, mobili...
Vincenzo Grassi, Raffaela Mirandola
ISPD
2012
ACM
252views Hardware» more  ISPD 2012»
13 years 6 months ago
Towards layout-friendly high-level synthesis
There are two prominent problems with technology scaling: increasing design complexity and more challenges with interconnect design, including routability. High-level synthesis ha...
Jason Cong, Bin Liu 0006, Guojie Luo, Raghu Prabha...