Sciweavers

89 search results - page 8 / 18
» Abstraction Heuristics Extended with Counting Abstractions
Sort
View
85
Voted
ICMT
2009
Springer
15 years 4 months ago
Pattern-Based Model-to-Model Transformation: Handling Attribute Conditions
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
Esther Guerra, Juan de Lara, Fernando Orejas
HEURISTICS
2010
14 years 7 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
STACS
2007
Springer
15 years 3 months ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
INFOCOM
2008
IEEE
15 years 4 months ago
Adding Capacity Points to a Wireless Mesh Network Using Local Search
Abstract— Wireless mesh network deployments are popular as a cost-effective means to provide broadband connectivity to large user populations. As the network usage grows, network...
Joshua Robinson, Mustafa Uysal, Ram Swaminathan, E...
POPL
2010
ACM
15 years 7 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...