Sciweavers

3367 search results - page 310 / 674
» Incremental assignment problem
Sort
View
137
Voted
ICC
2009
IEEE
108views Communications» more  ICC 2009»
15 years 11 months ago
Scalable Alternatives to Virtual Output Queuing
—To avoid head of line blocking in switches, Virtual Output Queues (VOQs) are commonly used. However, the number of VOQs grows quadratically with the number of ports, making this...
Wladek Olesinski, Hans Eberle, Nils Gura
ICSM
2009
IEEE
15 years 11 months ago
Identifying high-level dependence structures using slice-based dependence analysis
This thesis presented a framework of the possible combination of approaches for low-level program slicing-baseddependence analysis and high-level concept assignment. Three combina...
Zheng Li
SEMWEB
2009
Springer
15 years 11 months ago
BeliefOWL: An Evidential Representation in OWL Ontology
The OWL is a language for representing ontologies but it is unable to capture the uncertainty about the concepts for a domain. To address the problem of representing uncertainty, w...
Amira Essaid, Boutheina Ben Yaghlane
110
Voted
CSR
2007
Springer
15 years 10 months ago
Pushing Random Walk Beyond Golden Ratio
We propose a simple modification of a well-known Random Walk algorithm for solving the Satisfiability problem and analyze its performance on random CNFs with a planted solution. ...
Ehsan Amiri, Evgeny S. Skvortsov
FOCS
2006
IEEE
15 years 10 months ago
How to Play Unique Games Using Embeddings
In this paper we present a new approximation algorithm for Unique Games. For a Unique Game with n vertices and k states (labels), if a (1 − ε) fraction of all constraints is sa...
Eden Chlamtac, Konstantin Makarychev, Yury Makaryc...