Sciweavers

42 search results - page 4 / 9
» On the Computational Complexity of Dominance Links in Gramma...
Sort
View
ICFCA
2009
Springer
14 years 2 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
WOLLIC
2010
Springer
14 years 17 days ago
Feasible Functions over Co-inductive Data
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
Ramyaa Ramyaa, Daniel Leivant
IFSA
2007
Springer
138views Fuzzy Logic» more  IFSA 2007»
14 years 1 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...
DAC
2007
ACM
14 years 8 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu
ERSHOV
2009
Springer
14 years 2 months ago
Towards a Scalable, Pragmatic Knowledge Representation Language for the Web
Abstract. A basic cornerstone of the Semantic Web are formal languages for describing resources in a clear and unambiguous way. Logical underpinnings facilitate automated reasoning...
Florian Fischer, Gulay Ünel, Barry Bishop, Di...