299 search results - page 21 / 60 » Dispositional implementation solves the superfluous structur... |
102
Voted
ALGORITHMICA
2008
15 years 2 months ago
2008
Color-coding is a technique to design fixed-parameter algorithms for several NP-complete subgraph isomorphism problems. Somewhat surprisingly, not much work has so far been spent ...
142
Voted
CCE
2005
15 years 2 months ago
2005
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new ...
120
click to vote
AAAI
1996
15 years 3 months ago
1996
In recent years, compositional modeling and selfexplanatory simulation techniques have simplified the process of building dynamic simulators of physical systems. Building steady-s...
124
click to vote
TOOLS
1997
IEEE
15 years 6 months ago
1997
IEEE
Software design patterns describe proven solutions to recurring software design problems. Knowledge of these patterns increases designers’ abilities, leads to cleaner and more e...
123
Voted
CAI
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. GP (for Graph Programs) is a rule-based, nondeterministic programming language for solving graph problems at a high level of abstraction, freeing programmers from handlin...