Sciweavers

2976 search results - page 182 / 596
» On the bounded integer programming
Sort
View
177
Voted
LPNMR
2001
Springer
15 years 11 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
INTERFACES
2008
77views more  INTERFACES 2008»
15 years 6 months ago
Showcase Scheduling at Fred Astaire East Side Dance Studio
: The ballroom dancing showcases at Fred Astaire East Side Dance Studio in Manhattan are held at least twice a year and provide the students with an environment for socializing, pr...
Miguel A. Lejeune, Nevena Yakova
160
Voted
ICCD
2004
IEEE
122views Hardware» more  ICCD 2004»
16 years 3 months ago
Linear Programming based Techniques for Synthesis of Network-on-Chip Architectures
Network-on-chip (NoC) has been proposed as a solution for the communication challenges of System-on-chip (SoC) design in the nanoscale regime. SoC design offers the opportunity fo...
Krishnan Srinivasan, Karam S. Chatha, Goran Konjev...
ISSTA
2006
ACM
16 years 12 days ago
Object distance and its application to adaptive random testing of object-oriented programs
Testing with random inputs can give surprisingly good results if the distribution of inputs is spread out evenly over the input domain; this is the intuition behind Adaptive Rando...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
ISSRE
2003
IEEE
15 years 11 months ago
A New Software Testing Approach Based on Domain Analysis of Specifications and Programs
Partition testing is a well-known software testing technique. This paper shows that partition testing strategies are relatively ineffective in detecting faults related to small sh...
Ruilian Zhao, Michael R. Lyu, Yinghua Min