Sciweavers

2316 search results - page 35 / 464
» The many forms of hypercomputation
Sort
View
CP
2003
Springer
15 years 9 months ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann
ISSAC
2001
Springer
141views Mathematics» more  ISSAC 2001»
15 years 8 months ago
On the Barnes function
The multiple Barnes function, defined as a generalization of the Euler gamma function, is used in many applications of pure and applied mathematics and theoretical physics. This pa...
Victor Adamchik
ERSHOV
1999
Springer
15 years 8 months ago
Twin - A Design Pattern for Modeling Multiple Inheritance
We introduce an object-oriented design pattern called Twin that allows us to model multiple inheritance in programming languages that do not support this feature (e.g. Java, Modula...
Hanspeter Mössenböck
DSN
2004
IEEE
15 years 7 months ago
A Defense-Centric Taxonomy Based on Attack Manifestations
Many classifications of attacks have been tendered, often in taxonomic form. A common basis of these taxonomies is that they have been framed from the perspective of an attacker
Kevin S. Killourhy, Roy A. Maxion, Kymie M. C. Tan
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
15 years 7 months ago
On data structures and asymmetric communication complexity
c communication case. This lemma generalizes and abstracts in a very clean form the ``round reduction'' techniques used in many previous lower bound proofs. ] 1998 Academ...
Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi...