Sciweavers

7661 search results - page 1411 / 1533
» Languages and the Computing Profession
Sort
View
JELIA
2010
Springer
15 years 2 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
PASTE
2010
ACM
15 years 2 months ago
Property-aware program sampling
Monitoring or profiling programs provides us with an understanding for its further improvement and analysis. Typically, for monitoring or profiling, the program is instrumented ...
Harish Narayanappa, Mukul S. Bansal, Hridesh Rajan
PC
2010
177views Management» more  PC 2010»
15 years 2 months ago
Parallel graph component labelling with GPUs and CUDA
Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simula...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
PVLDB
2010
96views more  PVLDB 2010»
15 years 2 months ago
Scalable Data Exchange with Functional Dependencies
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
Bruno Marnette, Giansalvatore Mecca, Paolo Papotti
RULEML
2010
Springer
15 years 2 months ago
Transformation of SBVR Compliant Business Rules to Executable FCL Rules
 The  main  source  of  changing  requirements  of  the  dynamic  business   environment  is  response  to  changes  in  regulations  and  contracts  towards  ...
Aqueo Kamada, Guido Governatori, Shazia Wasim Sadi...
« Prev « First page 1411 / 1533 Last » Next »