Sciweavers

4013 search results - page 206 / 803
» computer 2002
Sort
View
TRIER
2002
15 years 3 months ago
Polynomial Constants are Decidable
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs w...
Markus Müller-Olm, Helmut Seidl

Presentation
487views
17 years 2 months ago
Introduction to Optical Networking
A six-session course on Optical networking taught in 2002. These sessions covered the following topics: Fundamentals of Networking, Introduction to TCP/IP, Fundamentals of Op...
Raj Jain
WG
2005
Springer
15 years 9 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov
SQJ
2002
64views more  SQJ 2002»
15 years 3 months ago
Quality in Web Design for Visually Impaired Users
The current textual and graphical interfaces to computing, including the Web, is a dream come true for the hearing impaired. However, improved technology for voice and audio interf...
Margaret Ross
JASSS
2002
85views more  JASSS 2002»
15 years 3 months ago
Opinion dynamics and bounded confidence: models, analysis and simulation
When does opinion formation within an interacting group lead to consensus, polarization or fragmentation? The article investigates various models for the dynamics of continuous opi...
Rainer Hegselmann, Ulrich Krause