Sciweavers

1144 search results - page 21 / 229
» Logic programming for combinatorial problems
Sort
View
ACSC
2006
IEEE
14 years 1 months ago
Manufacturing opaque predicates in distributed systems for code obfuscation
Code obfuscation is a relatively new technique of software protection and it works by deterring reverse engineering attempts by malicious users of software. The objective of obfus...
Anirban Majumdar, Clark D. Thomborson
EUSFLAT
2009
122views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Semantic Proximity Between Queries and the Empty Answer Problem
This paper proposes an approach aimed at obviating empty answers for a family of conjunctive queries involving Boolean or fuzzy value constraints. Contrary to the approaches based ...
Patrick Bosc, Carmen Brando, Allel HadjAli, H&eacu...
JSAC
2007
63views more  JSAC 2007»
13 years 7 months ago
A new survivable mapping problem in IP-over-WDM networks
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
Chang Liu, Lu Ruan
CP
2005
Springer
14 years 1 months ago
SPREAD: A Balancing Constraint Based on Statistics
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
Gilles Pesant, Jean-Charles Régin
ICALP
1990
Springer
13 years 11 months ago
Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond
Termrewritingsystemsare importantfor computabilitytheoryof abstractdata types,for automatictheorem proving, and for the foundationsof functionalprogramming.In this shortsurveywe pr...
Jan Willem Klop