Sciweavers

7106 search results - page 169 / 1422
» Restricted Complexity, General Complexity
Sort
View
132
Voted
DOCENG
2004
ACM
15 years 9 months ago
Techniques for authoring complex XML documents
This paper reviews the main innovations of XML and considers their impact on the editing techniques for structured documents. Namespaces open the way to compound documents; well-f...
Vincent Quint, Irène Vatton
120
Voted
SIGECOM
2003
ACM
125views ECommerce» more  SIGECOM 2003»
15 years 8 months ago
Complexity of determining nonemptiness of the core
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 8 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
138
Voted
SAFECOMP
1998
Springer
15 years 7 months ago
An Agenda for Specifying Software Components with Complex Data Models
Abstract. We present a method to specify software for a special kind of safetycritical embedded systems, where sensors deliver low-level values that must be abstracted and pre-proc...
Kirsten Winter, Thomas Santen, Maritta Heisel
121
Voted
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 7 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks