1284 search results - page 55 / 257 » Connectivity in Bag Generation |
139
click to vote
AAAI
2000
15 years 6 months ago
2000
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
201
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
124
click to vote
TCS
2010
14 years 11 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
132
click to vote
DATE
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper we propose an embedded software design flow, which starts from an UML model and provides automatic mapping to other models like Simulink or finite-state machines (FS...
203
Voted
GLOBECOM
2008
IEEE
15 years 11 months ago
2008
IEEE
— Naming and addressing are important issues for Next Generation Internet (NGI). In this paper, we discuss a new Mobility and Multihoming supporting Identifier Locator Split Arch...