Sciweavers

3134 search results - page 369 / 627
» Computing full disjunctions
Sort
View
74
Voted
EOR
2010
102views more  EOR 2010»
15 years 25 days ago
The Tree of Hubs Location Problem
The Tree-of-Hubs Location Problem is studied. This problem, which combines several aspects of some location, network design and routing problems, is inspired by those transportati...
Iván A. Contreras, Elena Fernández, ...
97
Voted
AIL
2006
84views more  AIL 2006»
15 years 24 days ago
Meaningful electronic signatures based on an automatic indexing method
Legal information certification and secured storage combined with documents electronic signature are of great interest when digital documents security and conservation are in conce...
Maxime Wack, Ahmed Nait-Sidi-Moh, Sid Lamrous, Nat...
120
Voted
EJC
2008
15 years 24 days ago
On digraph coloring problems and treewidth duality
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
Albert Atserias
ENGL
2008
129views more  ENGL 2008»
15 years 24 days ago
The Creation of a Chinese Emotion Ontology Based on HowNet
Full comprehension of language comes about by understanding the meaning and the emotion behind the communication. Understanding the meaning of language is the goal of natural lang...
Jiajun Yan, David B. Bracewell, Fuji Ren, Shingo K...
ENTCS
2008
132views more  ENTCS 2008»
15 years 24 days ago
Distributed Verification of Multi-threaded C++ Programs
Verification of multi-threaded C++ programs poses three major challenges: the large number of states, states with huge sizes, and time intensive expansions of states. This paper p...
Stefan Edelkamp, Shahid Jabbar, Damian Sulewski