completeness - researchr tag

researchr

You are not signed in
Sign in
Sign up

2012

Measuring metadata-based aspect-oriented code in model-driven engineeringSagar Sunkle, Vinay Kulkarni, Suman RoyChoudhury. In Emerging Trends in Software Metrics (WETSoM), 2012 3rd International Workshop on. 2012: 2-8 [doi]

Declarative Specification of Template-Based Textual EditorsTobi Vollebregt. Master's thesis, Delft University of Technology, Delft, The Netherlands, April 2012. [doi]

Declarative Specification of Template-Based Textual EditorsTobi Vollebregt, Lennart C. L. Kats, Eelco Visser. LDTA 2012: [doi]

2011

About Complete Obligatory Hybrid Networks of Evolutionary Processors without SubstitutionArtiom Alhazov, Gemma Bel Enguix, Alexander Krassovitskiy, Yurii Rogozhin. iwann 2011: 441-448 [doi]

Connective Segmentation Generalized to Arbitrary Complete LatticesSeidon Alsaody, Jean Serra. ismm 2011: 61-72 [doi]

OMA 2011: orthology inference among 1000 complete genomesAdrian M. Altenhoff, Adrian Schneider, Gaston H. Gonnet, Christophe Dessimoz. nar, 39(Database-Issue):289-294, 2011. [doi]

Border basis detection is NP-completePrabhanjan Vijendra Ananth, Ambedkar Dukkipati. issac 2011: 11-18 [doi]

Key-Dependent Message Security: Generic Amplification and CompletenessBenny Applebaum. eurocrypt 2011: 527-546 [doi]

Complete Tensor Field Topology on 2D Triangulated Manifolds embedded in 3DCornelia Auer, Ingrid Hotz. cgf, 30(3):831-840, 2011. [doi]

Inapproximability of NP-Complete Variants of Nash EquilibriumPer Austrin, Mark Braverman, Eden Chlamtac. approx 2011: 13-25 [doi]

The transposition median problem is NP-completeMartin Bader. TCS, 412(12-14):1099-1110, 2011. [doi]

Light logics and optimal reduction: Completeness and complexityPatrick Baillot, Paolo Coppola, Ugo Dal Lago. iandc, 209(2):118-142, 2011. [doi]

Axiomatization and completeness of lexicographic products of modal logicsPhilippe Balbiani. jancl, 21(2):141-176, 2011. [doi]

Numerical representation of product transitive complete fuzzy orderingsIsmat Beg, Samina Ashraf. mcm, 53(5-6):617-623, 2011. [doi]

Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation MeadowsJan A. Bergstra, Inge Bethke. mst, 48(4):840-864, 2011. [doi]

The α-Arboricity of Complete Uniform HypergraphsJean-Claude Bermond, Y. M. Chee, Nathann Cohen, X. Zhang. siamdm, 25(2):600-610, 2011. [doi]

A sound and complete model-generation procedure for consistent and confidentiality-preserving databasesJoachim Biskup, Lena Wiese. TCS, 412(31):4044-4072, 2011. [doi]

Exact and complete short-read alignment to microbial genomes using Graphics Processing Unit programmingJochen Blom, Tobias Jakobi, Daniel Doppmeier, Sebastian Jaenicke, Jörn Kalinowski, Jens Stoye, Alexander Goesmann. bioinformatics, 27(10):1351-1358, 2011. [doi]

A Complete Algorithm for Generating LandmarksBlai Bonet, Julio Castillo. aips 2011: [doi]

Finite-Valued Lukasiewicz Modal Logic Is PSPACE-CompleteFélix Bou, Marco Cerami, Francesc Esteva. IJCAI 2011: 774-779 [doi]

Hybrid and First-Order Complete Extensions of CaRetLaura Bozzelli, Ruggero Lanotte. tableaux 2011: 58-72 [doi]

Sound and Complete Monitoring of Sequential Consistency for Relaxed Memory ModelsJacob Burnim, Koushik Sen, Christos Stergiou. TACAS 2011: 11-25 [doi]

All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than OthersChrister Bäckström, Peter Jonsson. socs 2011: [doi]

Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-CompleteStanislav Böhm, Stefan Göller. mfcs 2011: 194-205 [doi]

Asymptotic distributions of maxima of complete and incomplete samples from strongly dependent stationary Gaussian sequencesLunfeng Cao, Zuoxiang Peng. appml, 24(2):243-247, 2011. [doi]

vManager, Developing a Complete CBVR SystemAndrés Caro, Pablo García Rodríguez, Rubén Morcillo, Manuel Barrena. ibpria 2011: 604-611 [doi]

Complete triangular structures and Lie algebrasManuel Ceballos, Juan Núñez, Ángel F. Tenorio. ijcm, 88(9):1839-1851, 2011. [doi]

Complete Monotone Quasiconcave DualitySimone Cerreia-Vioglio, Fabio Maccheroni, Massimo Marinacci, Luigi Montrucchio. mor, 36(2):321-339, 2011. [doi]

Completeness of Order Algebras?Ivan Chajda, Radomír Halas, Hajime Machida. mvl, 17(1):93-98, 2011. [doi]

Lexicalized Non-Local MCTAG with Dominance Links is NP-CompleteLucas Champollion. jolli, 20(3):343-359, 2011. [doi]

Automatic recognition of complete palynomorphs in digital imagesJ. J. Charles. mva, 22(1):53-60, 2011. [doi]

Minimum Manhattan Network is NP-CompleteFrancis Y. L. Chin, Zeyu Guo, He Sun. dcg, 45(4):701-722, 2011. [doi]

When does a workflow complete?Parvathi Chundi, Tai Xin, Indrakshi Ray. csi, 33(3):292-300, 2011. [doi]

An XPath characterization of locally complete XML databasesAlvaro Cortés-Calabuig. icde 2011: 188-193 [doi]

Correctness of linear logic proof structures is NL-completePaulin Jacobé de Naurois, Virgile Mogbil. TCS, 412(20):1941-1957, 2011. [doi]

A complete resolution of the Keller maximum clique problemJennifer Debroni, John D. Eblen, Michael A. Langston, Wendy Myrvold, Peter W. Shor, Dinesh Weerapurage. soda 2011: 129-135 [doi]

COSMIC: mining complete cancer genomes in the Catalogue of Somatic Mutations in CancerSimon A. Forbes, Nidhi Bindal, Sally Bamford, Charlotte Cole, Chai Yin Kok, David Beare, Mingming Jia, Rebecca Shepherd, Kenric Leung, Andrew Menzies, Jon W. Teague, Peter J. Campbell, Michael R. Stratton, P. Andrew Futreal. nar, 39(Database-Issue):945-950, 2011. [doi]

Relational and Multirelational Representation Theorems for Complete Idempotent Left SemiringsHitoshi Furusawa, Koki Nishizawa. RelMiCS 2011: 148-163 [doi]

Relational completeness of query languages for annotated databasesFloris Geerts, Jan Van den Bussche. jcss, 77(3):491-504, 2011. [doi]

Finite group algebras of nilpotent groups: A complete set of orthogonal primitive idempotentsInneke Van Gelder, Gabriela Olteanu. ffa, 17(2):157-165, 2011. [doi]

Approximation Algorithms for QMA-Complete ProblemsSevag Gharibian, Julia Kempe. coco 2011: 178-188 [doi]

Unions of Disjoint NP-Complete SetsChristian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers. cocoon 2011: 240-251 [doi]

On Non-complete Sets and Restivo s ConjectureVladimir V. Gusev, Elena V. Pribavkina. dlt 2011: 239-250 [doi]

Observations on complete sets between linear time and polynomial timeArmin Hemmerling. iandc, 209(2):173-182, 2011. [doi]

Giant complete automaton for uncertain multiple string matching and its high speed construction algorithmYue Hu, Qingshi Gao, Li Guo, PeiFeng Wang. chinaf, 54(8):1562-1571, 2011. [doi]

Topological Sorting - How Should I Begin to Complete My To Do List?Hagen Höpfner. In Berthold Vöcking, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner, editors, Algorithms Unplugged. pages 39-45, Springer, 2011. [doi]

Complete Distributed Consequence Finding with Message PassingKatsumi Inoue, Gauvain Bourgne, Takayuki Okamoto. icaart 2011: 134-143

A stationary point theorem characterizing metric completenessJacek R. Jachymski. appml, 24(2):169-171, 2011. [doi]

Towards Complete Reasoning about Axiomatic SpecificationsSwen Jacobs, Viktor Kuncak. vmcai 2011: 278-293 [doi]

ConsensusPathDB: toward a more complete picture of cell biologyAtanas Kamburov, Konstantin Pentchev, Hanna Galicka, Christoph K. Wierling, Hans Lehrach, Ralf Herwig. nar, 39(Database-Issue):712-717, 2011. [doi]

Completeness and cut-elimination theorems for trilattice logicsNorihiro Kamide, Heinrich Wansing. APAL, 162(10):816-835, 2011. [doi]

A complete framework of simultaneous functional unit and register binding with skew schedulingMineo Kaneko. isqed 2011: 189-195 [doi]

The critical-square-grid coverage problem in wireless sensor networks is NP-CompleteWei-Chieh Ke, Bing-Hong Liu, Ming-Jer Tsai. cn, 55(9):2209-2220, 2011. [doi]

An Algorithm for Direct Construction of Complete Merged ProcessesVictor Khomenko, Andrey Mokhov. apn 2011: 89-108 [doi]

Time-Domain Blind Separation of Audio Sources on the Basis of a Complete ICA Decomposition of an Observation SpaceZbynek Koldovský, Petr Tichavský. taslp, 19(2):406-416, 2011. [doi]

Autonomous generation of complete 3D object models using next best view manipulation planningMichael Krainin, Brian Curless, Dieter Fox. icra 2011: 5031-5037 [doi]

Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party FunctionsDaniel Kraschewski, Jörn Müller-Quade. tcc 2011: 364-381 [doi]

Theories of initial segments of standard models of arithmetics and their complete extensionsMichal Krynicki, Jerzy Tomasik, Konrad Zdanowski. TCS, 412(31):3975-3991, 2011. [doi]

Linear Dependent Types and Relative CompletenessUgo Dal Lago, Marco Gaboardi. lics 2011: 133-142 [doi]

The Banzhaf index in complete and incomplete shareholding structures: A new algorithmMarc Levy. eor, 215(2):411-421, 2011. [doi]

Transforming Complete Coverage Algorithms to Partial Coverage Algorithms for Wireless Sensor NetworksYingshu Li, Chinh T. Vu, Chunyu Ai, Guantao Chen, Yi Zhao. tpds, 22(4):695-703, 2011. [doi]

Auditory Brain-Computer Interfaces for Complete Locked-In PatientsM. A. Lopez-Gordo, Ricardo Ron-Angevin, Francisco Pelayo Valle. iwann 2011: 378-385 [doi]

Orthogonal Complete Discriminant Locality Preserving Projections for Face RecognitionGui-Fu Lu, Zhong Lin, Zhong Jin. npl, 33(3):235-250, 2011. [doi]

Scaling Up Game Theory: Achievable Set Methods for Efficiently Solving Stochastic Games of Complete and Incomplete InformationLiam MacDermed. AAAI 2011: [doi]

On Polish groups admitting a compatible complete left-invariant metricMaciej Malicki. JSYML, 76(2):437-447, 2011. [doi]

NP-completeness of the energy barrier problem without pseudoknots and temporary arcsJán Manuch, Chris Thachuk, Ladislav Stacho, Anne Condon. nc, 10(1):391-405, 2011. [doi]

Minimum average congestion of enhanced and augmented hypercubes into complete binary treesPaul Manuel. DAM, 159(5):360-366, 2011. [doi]

Simplicial and nonsimplicial complete subgraphsTerry A. McKee. dmgt, 31(3):577-586, 2011. [doi]

Minimally Complete RecommendationsDavid McSherry. IJCAI 2011: 2299-2304 [doi]

Expressiveness of the Interval Logics of Allens Relations on the Class of All Linear Orders: Complete ClassificationDario Della Monica, Valentin Goranko, Angelo Montanari, Guido Sciavicco. IJCAI 2011: 845-850 [doi]

Completeness with respect to a chain and universal models in fuzzy logicFranco Montagna. AML, 50(1-2):161-183, 2011. [doi]

Improving completeness in multi-adjoint logic computations via general reductantsPedro J. Morcillo, Ginés Moreno. foci 2011: 138-145 [doi]

Complete Formal Hardware Verification of Interfaces for a FlexRay-Like BusChristian Müller, Wolfgang Paul. cav 2011: 633-648 [doi]

Real-time multidisciplinary team meeting management systems. A comparison with paper records for staging completeness and waiting timesGiulio Napolitano, Elizabeth Ranaghan, Richard Middleton, Colin Fox, Anna Gavin. behaviourIT, 30(4):473-477, 2011. [doi]

Coupled common fixed point theorems for a pair of commuting mappings in partially ordered complete metric spacesHemant Kumar Nashine, Wasfi Shatanawi. cma, 62(4):1984-1993, 2011. [doi]

A Complete Algorithm for Searchlight SchedulingKarl J. Obermeyer, Anurag Ganguli, Francesco Bullo. ijcga, 21(1):101-130, 2011. [doi]

A simple P-complete problem and its language-theoretic representationsAlexander Okhotin. TCS, 412(1-2):68-82, 2011. [doi]

A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminalsHassan Rashidi, Edward P. K. Tsang. cma, 61(3):630-641, 2011. [doi]

The NP-completeness of the Road Coloring ProblemAdam Roman. ipl, 111(7):342-347, 2011. [doi]

Corrigendum to Linear complete differential resultants and the implicitization of linear DPPEs [J. Symbolic ComputSonia L. Rueda, J. Rafael Sendra. JSC, 46(1):45, 2011.

Survey of polynomial transformations between NP-complete problemsJorge A. Ruiz-Vanoye, Joaquín Pérez Ortega, Rodolfo A. Pazos, Ocotlán Díaz-Parra, Juan Frausto Solís, Héctor Joaquin Fraire Huacuja, Laura Cruz Reyes, José A. Martínez Flores. jcam, 235(16):4851-4865, 2011. [doi]

Hamiltonian index is NP-completeZdenek Ryjácek, Gerhard J. Woeginger, Liming Xiong. DAM, 159(4):246-250, 2011. [doi]

P, NP, and NP-Completeness: the basics of computational complexity by Oded GoldreichRobert Schaefer. sigsoft, 36(1):37-38, 2011. [doi]

Completeness of fair ASM refinementGerhard Schellhorn. SCP, 76(9):756-773, 2011. [doi]

Combinations and completeness transfer for quantified modal logicsGerhard Schurz. igpl, 19(4):598-616, 2011. [doi]

Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract)Peter Selinger. ENTCS, 270(1):113-119, 2011. [doi]

Complete monotonicity results for some functions involving the gamma and polygamma functionsHamdullah Sevli, Necdet Batir. mcm, 53(9-10):1771-1775, 2011. [doi]

Choosing where to go: Complete 3D exploration with stereoRobert Shade, Paul Newman. icra 2011: 2806-2811 [doi]

The Finite Volume-Complete Flux Scheme for Advection-Diffusion-Reaction EquationsJ. H. M. ten Thije Boonkkamp, M. J. H. Anthonissen. jscic, 46(1):47-70, 2011. [doi]

A complete ensemble empirical mode decomposition with adaptive noiseMaría Eugenia Torres, Marcelo A. Colominas, Gastón Schlotthauer, Patrick Flandrin. icassp 2011: 4144-4147 [doi]

The complete mixability and convex minimization problems with monotone marginal densitiesBin Wang, Ruodu Wang. ma, 102(10):1344-1360, 2011. [doi]

An optimal power mean inequality for the complete elliptic integralsMiao-Kun Wang, Yu-Ming Chu, Ye-Fang Qiu, Song-Liang Qiu. appml, 24(6):887-890, 2011. [doi]

Tractable Massively Multi-Agent Pathfinding with Solution Quality and Completeness GuaranteesKo-Hsin Cindy Wang. IJCAI 2011: 2860-2861 [doi]

Hyperconnections and Openings on Complete LatticesMichael H. F. Wilkinson. ismm 2011: 73-84 [doi]

The complete solution to the Sylvester-polynomial-conjugate matrix equationsAi-Guo Wu, Gang Feng, Wanquan Liu, Guang-Ren Duan. mcm, 53(9-10):2044-2056, 2011. [doi]

Optimal complete terrain coverage using an Unmanned Aerial VehicleAnqi Xu, Chatavut Viriyasuthee, Ioannis M. Rekleitis. icra 2011: 2513-2519 [doi]

Structural learning for Bayesian networks by testing complete separators in prime blocksPing-Feng Xu, Jianhua Guo, Man-Lai Tang. csda, 55(12):3135-3147, 2011. [doi]

Quantitative domains via fuzzy sets: Part II: Fuzzy Scott topology on fuzzy directed-complete posetsWei Yao, Fu-Gui Shi. fss, 173(1):60-80, 2011. [doi]

Fixed point theorems in partially ordered complete metric spacesLi Zhilong. mcm, 54(1-2):69-72, 2011. [doi]

Basic operations, completeness and dynamicity of cyber physical socio semantic link network CPSocio-SLNHai Zhuge, Bei Xu. concurrency, 23(9):924-939, 2011. [doi]

PreviousNext