Sciweavers

840 search results - page 11 / 168
» The Complexity of the Extended GCD Problem
Sort
View
CSJM
2006
81views more  CSJM 2006»
13 years 7 months ago
Nash equilibria set computing in finite extended games
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Valeriu Ungureanu
DEXAW
2006
IEEE
156views Database» more  DEXAW 2006»
14 years 1 months ago
Social Enterprise Architecture: Towards an Extendable and Scaleable System Architecture for KM
Internet should be used to reduce distances and bring people virtually closer. Using ICT, many people has overcome the problem of digital divided [1] thanks to support of informat...
Flavio Corradini, Alberto Polzonetti, Romeo Pruno,...
INEX
2004
Springer
14 years 1 months ago
Narrowed Extended XPath I (NEXI)
INEX has through the years provided two types of queries: Content-Only queries (CO) and Content-And-Structure queries (CAS). The CO language has not changed much, but the CAS lang...
Andrew Trotman, Börkur Sigurbjörnsson
AIPS
2003
13 years 9 months ago
A Framework for Planning with Extended Goals under Partial Observability
Planning in nondeterministic domains with temporally extended goals under partial observability is one of the most challenging problems in planning. Subsets of this problem have b...
Piergiorgio Bertoli, Alessandro Cimatti, Marco Pis...
SP
2008
IEEE
112views Security Privacy» more  SP 2008»
14 years 2 months ago
XFA: Faster Signature Matching with Extended Automata
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...
Randy Smith, Cristian Estan, Somesh Jha