2555 search results - page 67 / 511 » Putting complex systems to work |
75
Voted
AAAI
2008
15 years 3 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
98
Voted
I3E
2001
15 years 2 months ago
2001
Electronic-banking applications (EBAs) are among the pioneers of electroniccommerce (e-commerce) applications. Like other e-commerce applications, they require sophisticated secur...
110
click to vote
AI
2008
Springer
15 years 28 days ago
2008
Springer
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
106
Voted
CORR
2010
Springer
15 years 27 days ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
86
Voted
SIES
2007
IEEE
15 years 7 months ago
2007
IEEE
In our previous work [1], Full Duplex Switched Ethernet was put forward as an attractive candidate to replace the MIL-STD 1553B data bus, in next generation "1553B"embedd...