Sciweavers

1763 search results - page 349 / 353
» A Formalization of Polytime Functions
Sort
View
TCAD
2008
101views more  TCAD 2008»
13 years 7 months ago
Using Field-Repairable Control Logic to Correct Design Errors in Microprocessors
Functional correctness is a vital attribute of any hardware design. Unfortunately, due to extremely complex architectures, widespread components, such as microprocessors, are often...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
JKM
2007
161views more  JKM 2007»
13 years 7 months ago
A strategy-based ontology of knowledge management technologies
Purpose – The purpose of this paper is to distinguish and describe knowledge management (KM) technologies according to their support for strategy. Design/methodology/approach â€...
Andre Saito, Katsuhiro Umemoto, Mitsuru Ikeda
JLP
2007
89views more  JLP 2007»
13 years 7 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
AI
2002
Springer
13 years 7 months ago
Using similarity criteria to make issue trade-offs in automated negotiations
Automated negotiation is a key form of interaction in systems that are composed of multiple autonomous agents. The aim of such interactions is to reach agreements through an itera...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
CN
2004
150views more  CN 2004»
13 years 7 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz