Sciweavers

2042 search results - page 85 / 409
» Variable Number of
Sort
View
IPL
2000
96views more  IPL 2000»
15 years 3 months ago
On bounded occurrence constraint satisfaction
An approximation algorithm for a constraint satisfaction problem is said to be nontrivial if its performance ratio is strictly superior to the expected performance of the algorith...
Johan Håstad
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
15 years 2 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
ECAI
2006
Springer
15 years 7 months ago
Compiling Possibilistic Knowledge Bases
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
Salem Benferhat, Henri Prade
IPMU
2010
Springer
15 years 8 months ago
Independent Natural Extension
We introduce a general definition for the independence of a number of finite-valued variables, based on coherent lower previsions. Our definition has an epistemic flavour: it a...
Gert de Cooman, Enrique Miranda, Marco Zaffalon
ASPDAC
1995
ACM
103views Hardware» more  ASPDAC 1995»
15 years 7 months ago
A scheduling algorithm for multiport memory minimization in datapath synthesis
- In this paper, we present a new scheduling algorithms that generates area-efficient register transfer level datapaths with multiport memories. The proposed scheduling algorithm a...
Hae-Dong Lee, Sun-Young Hwang